./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/recursive/Primes.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 63182f13 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Primes.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16beca065b3aeb336c54dcf96f3abbe61553e7d28b28c1a40f525ad89a5da56e --- Real Ultimate output --- This is Ultimate 0.2.1-dev-63182f1 [2021-11-12 23:35:19,544 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-12 23:35:19,546 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-12 23:35:19,608 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-12 23:35:19,609 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-12 23:35:19,610 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-12 23:35:19,614 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-12 23:35:19,619 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-12 23:35:19,621 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-12 23:35:19,626 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-12 23:35:19,627 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-12 23:35:19,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-12 23:35:19,629 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-12 23:35:19,632 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-12 23:35:19,635 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-12 23:35:19,645 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-12 23:35:19,646 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-12 23:35:19,647 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-12 23:35:19,650 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-12 23:35:19,657 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-12 23:35:19,659 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-12 23:35:19,661 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-12 23:35:19,664 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-12 23:35:19,665 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-12 23:35:19,677 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-12 23:35:19,677 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-12 23:35:19,678 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-12 23:35:19,679 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-12 23:35:19,680 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-12 23:35:19,681 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-12 23:35:19,682 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-12 23:35:19,682 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-12 23:35:19,684 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-12 23:35:19,685 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-12 23:35:19,686 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-12 23:35:19,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-12 23:35:19,687 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-12 23:35:19,687 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-12 23:35:19,688 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-12 23:35:19,688 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-12 23:35:19,689 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-12 23:35:19,690 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/config/svcomp-Overflow-32bit-Taipan_Default.epf [2021-11-12 23:35:19,728 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-12 23:35:19,728 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-12 23:35:19,729 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-12 23:35:19,730 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-12 23:35:19,730 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-12 23:35:19,730 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-12 23:35:19,730 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-12 23:35:19,730 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-12 23:35:19,731 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-12 23:35:19,731 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-12 23:35:19,732 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-12 23:35:19,732 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-12 23:35:19,732 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-12 23:35:19,732 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-12 23:35:19,733 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-12 23:35:19,733 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-12 23:35:19,734 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-12 23:35:19,734 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-12 23:35:19,734 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-12 23:35:19,734 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-12 23:35:19,735 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-12 23:35:19,735 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-12 23:35:19,735 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-12 23:35:19,735 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-12 23:35:19,735 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-12 23:35:19,736 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-11-12 23:35:19,736 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-12 23:35:19,736 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-12 23:35:19,736 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-12 23:35:19,736 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-12 23:35:19,737 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-12 23:35:19,737 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-12 23:35:19,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-12 23:35:19,737 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-12 23:35:19,738 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-12 23:35:19,738 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-12 23:35:19,738 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-12 23:35:19,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-12 23:35:19,738 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-12 23:35:19,738 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-12 23:35:19,739 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-12 23:35:19,739 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_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/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_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 16beca065b3aeb336c54dcf96f3abbe61553e7d28b28c1a40f525ad89a5da56e [2021-11-12 23:35:20,020 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-12 23:35:20,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-12 23:35:20,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-12 23:35:20,064 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-12 23:35:20,065 INFO L275 PluginConnector]: CDTParser initialized [2021-11-12 23:35:20,066 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/../../sv-benchmarks/c/recursive/Primes.c [2021-11-12 23:35:20,143 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/data/cb0288fac/1db6f067783240d6961a7bcfd9ff7071/FLAGc2593cd1a [2021-11-12 23:35:20,668 INFO L306 CDTParser]: Found 1 translation units. [2021-11-12 23:35:20,669 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/sv-benchmarks/c/recursive/Primes.c [2021-11-12 23:35:20,680 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/data/cb0288fac/1db6f067783240d6961a7bcfd9ff7071/FLAGc2593cd1a [2021-11-12 23:35:21,035 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/data/cb0288fac/1db6f067783240d6961a7bcfd9ff7071 [2021-11-12 23:35:21,037 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-12 23:35:21,038 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-12 23:35:21,040 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-12 23:35:21,040 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-12 23:35:21,043 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-12 23:35:21,044 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 11:35:21" (1/1) ... [2021-11-12 23:35:21,045 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f70f315 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:35:21, skipping insertion in model container [2021-11-12 23:35:21,045 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 11:35:21" (1/1) ... [2021-11-12 23:35:21,052 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-12 23:35:21,070 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-12 23:35:21,276 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_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/sv-benchmarks/c/recursive/Primes.c[2190,2203] [2021-11-12 23:35:21,277 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-12 23:35:21,285 INFO L203 MainTranslator]: Completed pre-run [2021-11-12 23:35:21,306 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_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/sv-benchmarks/c/recursive/Primes.c[2190,2203] [2021-11-12 23:35:21,307 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-12 23:35:21,320 INFO L208 MainTranslator]: Completed translation [2021-11-12 23:35:21,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:35:21 WrapperNode [2021-11-12 23:35:21,320 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-12 23:35:21,321 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-12 23:35:21,321 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-12 23:35:21,321 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-12 23:35:21,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:35:21" (1/1) ... [2021-11-12 23:35:21,348 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:35:21" (1/1) ... [2021-11-12 23:35:21,371 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-12 23:35:21,372 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-12 23:35:21,372 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-12 23:35:21,373 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-12 23:35:21,381 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:35:21" (1/1) ... [2021-11-12 23:35:21,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:35:21" (1/1) ... [2021-11-12 23:35:21,384 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:35:21" (1/1) ... [2021-11-12 23:35:21,384 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:35:21" (1/1) ... [2021-11-12 23:35:21,389 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:35:21" (1/1) ... [2021-11-12 23:35:21,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:35:21" (1/1) ... [2021-11-12 23:35:21,394 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:35:21" (1/1) ... [2021-11-12 23:35:21,396 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-12 23:35:21,397 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-12 23:35:21,397 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-12 23:35:21,397 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-12 23:35:21,398 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:35:21" (1/1) ... [2021-11-12 23:35:21,412 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-12 23:35:21,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:35:21,434 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-12 23:35:21,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-12 23:35:21,474 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of [2021-11-12 23:35:21,474 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of [2021-11-12 23:35:21,475 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2021-11-12 23:35:21,475 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2021-11-12 23:35:21,475 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ [2021-11-12 23:35:21,475 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ [2021-11-12 23:35:21,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-12 23:35:21,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-12 23:35:21,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-12 23:35:21,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-12 23:35:21,905 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-12 23:35:21,906 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-12 23:35:21,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 11:35:21 BoogieIcfgContainer [2021-11-12 23:35:21,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-12 23:35:21,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-12 23:35:21,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-12 23:35:21,914 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-12 23:35:21,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 11:35:21" (1/3) ... [2021-11-12 23:35:21,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cbf1261 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 11:35:21, skipping insertion in model container [2021-11-12 23:35:21,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:35:21" (2/3) ... [2021-11-12 23:35:21,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cbf1261 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 11:35:21, skipping insertion in model container [2021-11-12 23:35:21,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 11:35:21" (3/3) ... [2021-11-12 23:35:21,917 INFO L111 eAbstractionObserver]: Analyzing ICFG Primes.c [2021-11-12 23:35:21,922 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-12 23:35:21,922 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2021-11-12 23:35:22,006 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-12 23:35:22,018 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-12 23:35:22,018 INFO L340 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2021-11-12 23:35:22,054 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 50 states have (on average 1.64) internal successors, (82), 66 states have internal predecessors, (82), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-11-12 23:35:22,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-11-12 23:35:22,057 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:35:22,058 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-11-12 23:35:22,058 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-12 23:35:22,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:35:22,067 INFO L85 PathProgramCache]: Analyzing trace with hash 185888, now seen corresponding path program 1 times [2021-11-12 23:35:22,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:35:22,079 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902817494] [2021-11-12 23:35:22,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:35:22,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:35:22,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:35:22,321 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-12 23:35:22,321 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:35:22,321 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902817494] [2021-11-12 23:35:22,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902817494] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:35:22,323 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:35:22,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-12 23:35:22,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474478056] [2021-11-12 23:35:22,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:35:22,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-12 23:35:22,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:35:22,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-12 23:35:22,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-12 23:35:22,373 INFO L87 Difference]: Start difference. First operand has 79 states, 50 states have (on average 1.64) internal successors, (82), 66 states have internal predecessors, (82), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:35:22,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:35:22,456 INFO L93 Difference]: Finished difference Result 81 states and 101 transitions. [2021-11-12 23:35:22,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-12 23:35:22,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-11-12 23:35:22,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:35:22,473 INFO L225 Difference]: With dead ends: 81 [2021-11-12 23:35:22,473 INFO L226 Difference]: Without dead ends: 74 [2021-11-12 23:35:22,476 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-12 23:35:22,486 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 13 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.07ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46.72ms IncrementalHoareTripleChecker+Time [2021-11-12 23:35:22,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 174 Invalid, 10 Unknown, 0 Unchecked, 4.07ms Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 46.72ms Time] [2021-11-12 23:35:22,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-11-12 23:35:22,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2021-11-12 23:35:22,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 47 states have (on average 1.574468085106383) internal successors, (74), 62 states have internal predecessors, (74), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-11-12 23:35:22,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2021-11-12 23:35:22,546 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 3 [2021-11-12 23:35:22,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:35:22,547 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2021-11-12 23:35:22,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:35:22,547 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2021-11-12 23:35:22,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-11-12 23:35:22,548 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:35:22,548 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-11-12 23:35:22,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-12 23:35:22,549 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-12 23:35:22,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:35:22,549 INFO L85 PathProgramCache]: Analyzing trace with hash 5762635, now seen corresponding path program 1 times [2021-11-12 23:35:22,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:35:22,550 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440178624] [2021-11-12 23:35:22,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:35:22,550 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:35:22,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:35:22,583 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-12 23:35:22,584 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:35:22,584 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440178624] [2021-11-12 23:35:22,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440178624] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:35:22,584 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:35:22,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-12 23:35:22,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965438099] [2021-11-12 23:35:22,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:35:22,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-12 23:35:22,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:35:22,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-12 23:35:22,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-12 23:35:22,588 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:35:22,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:35:22,607 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2021-11-12 23:35:22,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-12 23:35:22,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-11-12 23:35:22,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:35:22,635 INFO L225 Difference]: With dead ends: 74 [2021-11-12 23:35:22,635 INFO L226 Difference]: Without dead ends: 73 [2021-11-12 23:35:22,635 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-12 23:35:22,645 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 5 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.79ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.18ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.14ms IncrementalHoareTripleChecker+Time [2021-11-12 23:35:22,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 167 Invalid, 5 Unknown, 0 Unchecked, 2.18ms Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 7.14ms Time] [2021-11-12 23:35:22,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-11-12 23:35:22,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-11-12 23:35:22,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 47 states have (on average 1.553191489361702) internal successors, (73), 61 states have internal predecessors, (73), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-11-12 23:35:22,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2021-11-12 23:35:22,674 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 4 [2021-11-12 23:35:22,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:35:22,674 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2021-11-12 23:35:22,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:35:22,675 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2021-11-12 23:35:22,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-12 23:35:22,676 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:35:22,676 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:35:22,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-12 23:35:22,677 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-12 23:35:22,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:35:22,678 INFO L85 PathProgramCache]: Analyzing trace with hash -467491885, now seen corresponding path program 1 times [2021-11-12 23:35:22,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:35:22,678 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622459302] [2021-11-12 23:35:22,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:35:22,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:35:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:35:22,761 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-12 23:35:22,761 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:35:22,761 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622459302] [2021-11-12 23:35:22,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622459302] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:35:22,762 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:35:22,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-12 23:35:22,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559093953] [2021-11-12 23:35:22,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:35:22,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-12 23:35:22,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:35:22,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-12 23:35:22,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-12 23:35:22,764 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand has 5 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:35:22,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:35:22,839 INFO L93 Difference]: Finished difference Result 136 states and 175 transitions. [2021-11-12 23:35:22,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-12 23:35:22,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-11-12 23:35:22,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:35:22,847 INFO L225 Difference]: With dead ends: 136 [2021-11-12 23:35:22,847 INFO L226 Difference]: Without dead ends: 68 [2021-11-12 23:35:22,849 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-12 23:35:22,850 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 43 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.98ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.48ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45.34ms IncrementalHoareTripleChecker+Time [2021-11-12 23:35:22,851 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 233 Invalid, 53 Unknown, 0 Unchecked, 3.48ms Time], IncrementalHoareTripleChecker [9 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 45.34ms Time] [2021-11-12 23:35:22,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-11-12 23:35:22,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2021-11-12 23:35:22,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 55 states have internal predecessors, (65), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-12 23:35:22,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2021-11-12 23:35:22,864 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 14 [2021-11-12 23:35:22,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:35:22,865 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 80 transitions. [2021-11-12 23:35:22,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:35:22,865 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2021-11-12 23:35:22,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-12 23:35:22,866 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:35:22,866 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:35:22,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-12 23:35:22,867 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-12 23:35:22,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:35:22,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1607339527, now seen corresponding path program 1 times [2021-11-12 23:35:22,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:35:22,868 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21831388] [2021-11-12 23:35:22,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:35:22,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:35:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:35:22,957 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-12 23:35:22,958 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:35:22,958 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21831388] [2021-11-12 23:35:22,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21831388] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:35:22,959 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:35:22,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-12 23:35:22,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204395057] [2021-11-12 23:35:22,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:35:22,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-12 23:35:22,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:35:22,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-12 23:35:22,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-12 23:35:22,961 INFO L87 Difference]: Start difference. First operand 66 states and 80 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:35:23,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:35:23,070 INFO L93 Difference]: Finished difference Result 142 states and 175 transitions. [2021-11-12 23:35:23,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-12 23:35:23,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-12 23:35:23,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:35:23,080 INFO L225 Difference]: With dead ends: 142 [2021-11-12 23:35:23,080 INFO L226 Difference]: Without dead ends: 81 [2021-11-12 23:35:23,082 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-12 23:35:23,083 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 31 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 49.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.90ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 82.45ms IncrementalHoareTripleChecker+Time [2021-11-12 23:35:23,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 260 Invalid, 61 Unknown, 0 Unchecked, 2.90ms Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 82.45ms Time] [2021-11-12 23:35:23,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-11-12 23:35:23,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2021-11-12 23:35:23,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 64 states have internal predecessors, (76), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-11-12 23:35:23,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 93 transitions. [2021-11-12 23:35:23,097 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 93 transitions. Word has length 15 [2021-11-12 23:35:23,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:35:23,097 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 93 transitions. [2021-11-12 23:35:23,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:35:23,097 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 93 transitions. [2021-11-12 23:35:23,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-12 23:35:23,098 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:35:23,098 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:35:23,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-12 23:35:23,099 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-12 23:35:23,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:35:23,099 INFO L85 PathProgramCache]: Analyzing trace with hash 665532417, now seen corresponding path program 1 times [2021-11-12 23:35:23,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:35:23,100 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19719861] [2021-11-12 23:35:23,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:35:23,100 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:35:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:35:23,162 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-12 23:35:23,163 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:35:23,163 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19719861] [2021-11-12 23:35:23,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19719861] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:35:23,163 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:35:23,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-12 23:35:23,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484829343] [2021-11-12 23:35:23,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:35:23,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-12 23:35:23,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:35:23,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-12 23:35:23,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-12 23:35:23,165 INFO L87 Difference]: Start difference. First operand 77 states and 93 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-12 23:35:23,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:35:23,205 INFO L93 Difference]: Finished difference Result 106 states and 127 transitions. [2021-11-12 23:35:23,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-12 23:35:23,212 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-11-12 23:35:23,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:35:23,213 INFO L225 Difference]: With dead ends: 106 [2021-11-12 23:35:23,213 INFO L226 Difference]: Without dead ends: 79 [2021-11-12 23:35:23,214 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-12 23:35:23,215 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 1 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.74ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.27ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.76ms IncrementalHoareTripleChecker+Time [2021-11-12 23:35:23,216 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 378 Invalid, 21 Unknown, 0 Unchecked, 2.27ms Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 16.76ms Time] [2021-11-12 23:35:23,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-11-12 23:35:23,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2021-11-12 23:35:23,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 66 states have internal predecessors, (77), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2021-11-12 23:35:23,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2021-11-12 23:35:23,233 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 17 [2021-11-12 23:35:23,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:35:23,234 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2021-11-12 23:35:23,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-12 23:35:23,240 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2021-11-12 23:35:23,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-12 23:35:23,242 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:35:23,242 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:35:23,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-12 23:35:23,244 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting multiple_ofErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-12 23:35:23,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:35:23,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1535160157, now seen corresponding path program 1 times [2021-11-12 23:35:23,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:35:23,246 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797524856] [2021-11-12 23:35:23,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:35:23,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:35:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:35:23,357 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-12 23:35:23,357 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:35:23,357 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797524856] [2021-11-12 23:35:23,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797524856] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:35:23,358 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:35:23,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-12 23:35:23,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171486034] [2021-11-12 23:35:23,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:35:23,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-12 23:35:23,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:35:23,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-12 23:35:23,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-12 23:35:23,360 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:35:23,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:35:23,511 INFO L93 Difference]: Finished difference Result 109 states and 131 transitions. [2021-11-12 23:35:23,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-12 23:35:23,512 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-11-12 23:35:23,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:35:23,513 INFO L225 Difference]: With dead ends: 109 [2021-11-12 23:35:23,513 INFO L226 Difference]: Without dead ends: 106 [2021-11-12 23:35:23,514 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-12 23:35:23,515 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 44 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 82.49ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.46ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 102.01ms IncrementalHoareTripleChecker+Time [2021-11-12 23:35:23,516 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 294 Invalid, 123 Unknown, 0 Unchecked, 4.46ms Time], IncrementalHoareTripleChecker [7 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 102.01ms Time] [2021-11-12 23:35:23,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-11-12 23:35:23,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2021-11-12 23:35:23,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 84 states have internal predecessors, (101), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2021-11-12 23:35:23,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 124 transitions. [2021-11-12 23:35:23,531 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 124 transitions. Word has length 17 [2021-11-12 23:35:23,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:35:23,532 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 124 transitions. [2021-11-12 23:35:23,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:35:23,532 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 124 transitions. [2021-11-12 23:35:23,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-12 23:35:23,533 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:35:23,533 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:35:23,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-12 23:35:23,534 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-12 23:35:23,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:35:23,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1355807845, now seen corresponding path program 1 times [2021-11-12 23:35:23,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:35:23,535 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024761642] [2021-11-12 23:35:23,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:35:23,535 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:35:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:35:23,581 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-12 23:35:23,581 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:35:23,582 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024761642] [2021-11-12 23:35:23,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024761642] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:35:23,582 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:35:23,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-12 23:35:23,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789706457] [2021-11-12 23:35:23,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:35:23,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-12 23:35:23,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:35:23,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-12 23:35:23,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-12 23:35:23,605 INFO L87 Difference]: Start difference. First operand 102 states and 124 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-12 23:35:23,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:35:23,676 INFO L93 Difference]: Finished difference Result 141 states and 173 transitions. [2021-11-12 23:35:23,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-12 23:35:23,676 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), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-11-12 23:35:23,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:35:23,679 INFO L225 Difference]: With dead ends: 141 [2021-11-12 23:35:23,679 INFO L226 Difference]: Without dead ends: 117 [2021-11-12 23:35:23,683 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-12 23:35:23,687 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 28 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.73ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.13ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.76ms IncrementalHoareTripleChecker+Time [2021-11-12 23:35:23,688 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 285 Invalid, 49 Unknown, 0 Unchecked, 2.13ms Time], IncrementalHoareTripleChecker [7 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 47.76ms Time] [2021-11-12 23:35:23,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-11-12 23:35:23,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 112. [2021-11-12 23:35:23,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 92 states have internal predecessors, (112), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2021-11-12 23:35:23,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 137 transitions. [2021-11-12 23:35:23,724 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 137 transitions. Word has length 18 [2021-11-12 23:35:23,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:35:23,725 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 137 transitions. [2021-11-12 23:35:23,725 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), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-12 23:35:23,726 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 137 transitions. [2021-11-12 23:35:23,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-12 23:35:23,727 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:35:23,727 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:35:23,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-12 23:35:23,728 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting multiple_ofErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-12 23:35:23,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:35:23,731 INFO L85 PathProgramCache]: Analyzing trace with hash 345324673, now seen corresponding path program 1 times [2021-11-12 23:35:23,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:35:23,732 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647409134] [2021-11-12 23:35:23,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:35:23,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:35:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:35:23,834 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-12 23:35:23,834 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:35:23,834 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647409134] [2021-11-12 23:35:23,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647409134] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:35:23,835 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:35:23,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-12 23:35:23,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481388064] [2021-11-12 23:35:23,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:35:23,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-12 23:35:23,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:35:23,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-12 23:35:23,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-12 23:35:23,838 INFO L87 Difference]: Start difference. First operand 112 states and 137 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:35:23,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:35:23,971 INFO L93 Difference]: Finished difference Result 114 states and 137 transitions. [2021-11-12 23:35:23,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-12 23:35:23,972 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-12 23:35:23,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:35:23,978 INFO L225 Difference]: With dead ends: 114 [2021-11-12 23:35:23,978 INFO L226 Difference]: Without dead ends: 113 [2021-11-12 23:35:23,979 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-12 23:35:23,980 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 42 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 76.49ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.49ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 92.70ms IncrementalHoareTripleChecker+Time [2021-11-12 23:35:23,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 263 Invalid, 112 Unknown, 0 Unchecked, 6.49ms Time], IncrementalHoareTripleChecker [8 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 92.70ms Time] [2021-11-12 23:35:23,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-11-12 23:35:23,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2021-11-12 23:35:23,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 82 states have (on average 1.3414634146341464) internal successors, (110), 92 states have internal predecessors, (110), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2021-11-12 23:35:23,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 135 transitions. [2021-11-12 23:35:23,998 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 135 transitions. Word has length 18 [2021-11-12 23:35:23,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:35:23,999 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 135 transitions. [2021-11-12 23:35:23,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:35:23,999 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 135 transitions. [2021-11-12 23:35:24,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-12 23:35:24,000 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:35:24,000 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:35:24,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-12 23:35:24,001 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-12 23:35:24,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:35:24,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1556028481, now seen corresponding path program 1 times [2021-11-12 23:35:24,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:35:24,002 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971623837] [2021-11-12 23:35:24,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:35:24,002 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:35:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:35:24,069 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-12 23:35:24,069 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:35:24,070 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971623837] [2021-11-12 23:35:24,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971623837] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:35:24,070 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:35:24,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-12 23:35:24,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141384416] [2021-11-12 23:35:24,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:35:24,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-12 23:35:24,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:35:24,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-12 23:35:24,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-12 23:35:24,071 INFO L87 Difference]: Start difference. First operand 112 states and 135 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-12 23:35:24,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:35:24,143 INFO L93 Difference]: Finished difference Result 135 states and 165 transitions. [2021-11-12 23:35:24,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-12 23:35:24,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-11-12 23:35:24,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:35:24,145 INFO L225 Difference]: With dead ends: 135 [2021-11-12 23:35:24,145 INFO L226 Difference]: Without dead ends: 133 [2021-11-12 23:35:24,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-12 23:35:24,146 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 41 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.87ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.64ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 55.84ms IncrementalHoareTripleChecker+Time [2021-11-12 23:35:24,147 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 254 Invalid, 67 Unknown, 0 Unchecked, 1.64ms Time], IncrementalHoareTripleChecker [13 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 55.84ms Time] [2021-11-12 23:35:24,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-11-12 23:35:24,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 127. [2021-11-12 23:35:24,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 95 states have (on average 1.3473684210526315) internal successors, (128), 104 states have internal predecessors, (128), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-11-12 23:35:24,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 157 transitions. [2021-11-12 23:35:24,158 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 157 transitions. Word has length 20 [2021-11-12 23:35:24,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:35:24,158 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 157 transitions. [2021-11-12 23:35:24,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-12 23:35:24,159 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 157 transitions. [2021-11-12 23:35:24,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-12 23:35:24,160 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:35:24,160 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:35:24,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-12 23:35:24,160 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-12 23:35:24,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:35:24,161 INFO L85 PathProgramCache]: Analyzing trace with hash -921459591, now seen corresponding path program 1 times [2021-11-12 23:35:24,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:35:24,161 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427401934] [2021-11-12 23:35:24,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:35:24,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:35:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:35:24,247 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-12 23:35:24,248 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:35:24,248 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427401934] [2021-11-12 23:35:24,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427401934] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:35:24,249 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008324097] [2021-11-12 23:35:24,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:35:24,249 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:35:24,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:35:24,256 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:35:24,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-12 23:35:24,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:35:24,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-12 23:35:24,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:35:24,493 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-12 23:35:24,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:35:24,665 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-12 23:35:24,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008324097] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-12 23:35:24,666 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1037816252] [2021-11-12 23:35:24,694 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2021-11-12 23:35:24,694 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:35:24,699 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-12 23:35:24,700 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-12 23:35:24,700 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2021-11-12 23:35:24,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792883496] [2021-11-12 23:35:24,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-12 23:35:24,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-12 23:35:24,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:35:24,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-12 23:35:24,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-11-12 23:35:24,702 INFO L87 Difference]: Start difference. First operand 127 states and 157 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 8 states have internal predecessors, (36), 5 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:35:24,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:35:24,977 INFO L93 Difference]: Finished difference Result 249 states and 311 transitions. [2021-11-12 23:35:24,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-12 23:35:24,978 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 8 states have internal predecessors, (36), 5 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-12 23:35:24,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:35:24,979 INFO L225 Difference]: With dead ends: 249 [2021-11-12 23:35:24,979 INFO L226 Difference]: Without dead ends: 141 [2021-11-12 23:35:24,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2021-11-12 23:35:24,981 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 118 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 157.78ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.09ms SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 190.04ms IncrementalHoareTripleChecker+Time [2021-11-12 23:35:24,982 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 436 Invalid, 298 Unknown, 0 Unchecked, 4.09ms Time], IncrementalHoareTripleChecker [26 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 190.04ms Time] [2021-11-12 23:35:24,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-11-12 23:35:24,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 138. [2021-11-12 23:35:24,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 104 states have (on average 1.3365384615384615) internal successors, (139), 113 states have internal predecessors, (139), 16 states have call successors, (16), 9 states have call predecessors, (16), 8 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-11-12 23:35:24,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 170 transitions. [2021-11-12 23:35:24,993 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 170 transitions. Word has length 23 [2021-11-12 23:35:24,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:35:24,994 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 170 transitions. [2021-11-12 23:35:24,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 8 states have internal predecessors, (36), 5 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:35:24,994 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 170 transitions. [2021-11-12 23:35:24,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-12 23:35:24,995 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:35:24,995 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:35:25,034 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-12 23:35:25,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:35:25,220 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-12 23:35:25,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:35:25,220 INFO L85 PathProgramCache]: Analyzing trace with hash 200055403, now seen corresponding path program 1 times [2021-11-12 23:35:25,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:35:25,221 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144217126] [2021-11-12 23:35:25,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:35:25,221 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:35:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:35:25,289 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-12 23:35:25,289 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:35:25,290 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144217126] [2021-11-12 23:35:25,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144217126] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-12 23:35:25,290 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-12 23:35:25,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-12 23:35:25,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616603880] [2021-11-12 23:35:25,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:35:25,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-12 23:35:25,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:35:25,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-12 23:35:25,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-12 23:35:25,292 INFO L87 Difference]: Start difference. First operand 138 states and 170 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-12 23:35:25,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:35:25,373 INFO L93 Difference]: Finished difference Result 164 states and 205 transitions. [2021-11-12 23:35:25,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-12 23:35:25,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-11-12 23:35:25,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:35:25,376 INFO L225 Difference]: With dead ends: 164 [2021-11-12 23:35:25,377 INFO L226 Difference]: Without dead ends: 162 [2021-11-12 23:35:25,377 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-12 23:35:25,378 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 40 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.68ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.10ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 57.29ms IncrementalHoareTripleChecker+Time [2021-11-12 23:35:25,378 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 248 Invalid, 65 Unknown, 0 Unchecked, 2.10ms Time], IncrementalHoareTripleChecker [11 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 57.29ms Time] [2021-11-12 23:35:25,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-11-12 23:35:25,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 153. [2021-11-12 23:35:25,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 117 states have (on average 1.3247863247863247) internal successors, (155), 125 states have internal predecessors, (155), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2021-11-12 23:35:25,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 190 transitions. [2021-11-12 23:35:25,399 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 190 transitions. Word has length 25 [2021-11-12 23:35:25,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:35:25,399 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 190 transitions. [2021-11-12 23:35:25,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-12 23:35:25,400 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 190 transitions. [2021-11-12 23:35:25,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-12 23:35:25,402 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:35:25,402 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:35:25,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-12 23:35:25,403 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting multiple_ofErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-12 23:35:25,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:35:25,403 INFO L85 PathProgramCache]: Analyzing trace with hash -759184931, now seen corresponding path program 1 times [2021-11-12 23:35:25,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:35:25,404 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658369762] [2021-11-12 23:35:25,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:35:25,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:35:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:35:25,497 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-12 23:35:25,497 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:35:25,497 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658369762] [2021-11-12 23:35:25,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658369762] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:35:25,497 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099308731] [2021-11-12 23:35:25,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:35:25,498 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:35:25,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:35:25,500 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:35:25,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-12 23:35:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:35:25,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-12 23:35:25,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:35:25,811 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:35:25,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:35:26,117 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:35:26,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099308731] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-12 23:35:26,118 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-12 23:35:26,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7, 9] total 23 [2021-11-12 23:35:26,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034015595] [2021-11-12 23:35:26,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:35:26,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-12 23:35:26,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:35:26,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-12 23:35:26,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2021-11-12 23:35:26,120 INFO L87 Difference]: Start difference. First operand 153 states and 190 transitions. Second operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:35:26,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:35:26,360 INFO L93 Difference]: Finished difference Result 176 states and 217 transitions. [2021-11-12 23:35:26,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-12 23:35:26,361 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-12 23:35:26,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:35:26,364 INFO L225 Difference]: With dead ends: 176 [2021-11-12 23:35:26,364 INFO L226 Difference]: Without dead ends: 174 [2021-11-12 23:35:26,365 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=659, Unknown=0, NotChecked=0, Total=756 [2021-11-12 23:35:26,366 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 89 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 133.42ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.11ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 166.37ms IncrementalHoareTripleChecker+Time [2021-11-12 23:35:26,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 326 Invalid, 270 Unknown, 0 Unchecked, 4.11ms Time], IncrementalHoareTripleChecker [18 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 166.37ms Time] [2021-11-12 23:35:26,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-11-12 23:35:26,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 168. [2021-11-12 23:35:26,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 129 states have (on average 1.310077519379845) internal successors, (169), 137 states have internal predecessors, (169), 20 states have call successors, (20), 11 states have call predecessors, (20), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2021-11-12 23:35:26,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 208 transitions. [2021-11-12 23:35:26,383 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 208 transitions. Word has length 25 [2021-11-12 23:35:26,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:35:26,383 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 208 transitions. [2021-11-12 23:35:26,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:35:26,384 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 208 transitions. [2021-11-12 23:35:26,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-12 23:35:26,392 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:35:26,393 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:35:26,426 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-12 23:35:26,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-12 23:35:26,608 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting multiple_ofErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-12 23:35:26,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:35:26,608 INFO L85 PathProgramCache]: Analyzing trace with hash -2059896319, now seen corresponding path program 1 times [2021-11-12 23:35:26,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:35:26,608 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164592681] [2021-11-12 23:35:26,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:35:26,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:35:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:35:26,682 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:35:26,682 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:35:26,682 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164592681] [2021-11-12 23:35:26,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164592681] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:35:26,683 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550475148] [2021-11-12 23:35:26,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:35:26,683 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:35:26,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:35:26,684 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:35:26,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-12 23:35:26,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:35:26,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-12 23:35:26,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:35:26,974 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:35:26,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:35:27,232 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:35:27,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550475148] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-12 23:35:27,233 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1595533647] [2021-11-12 23:35:27,236 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2021-11-12 23:35:27,236 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:35:27,236 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-12 23:35:27,237 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-12 23:35:27,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2021-11-12 23:35:27,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480656509] [2021-11-12 23:35:27,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-12 23:35:27,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-12 23:35:27,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:35:27,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-12 23:35:27,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2021-11-12 23:35:27,244 INFO L87 Difference]: Start difference. First operand 168 states and 208 transitions. Second operand has 23 states, 22 states have (on average 2.909090909090909) internal successors, (64), 14 states have internal predecessors, (64), 8 states have call successors, (9), 9 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:35:28,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:35:28,187 INFO L93 Difference]: Finished difference Result 212 states and 265 transitions. [2021-11-12 23:35:28,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-12 23:35:28,188 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.909090909090909) internal successors, (64), 14 states have internal predecessors, (64), 8 states have call successors, (9), 9 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-12 23:35:28,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:35:28,190 INFO L225 Difference]: With dead ends: 212 [2021-11-12 23:35:28,190 INFO L226 Difference]: Without dead ends: 209 [2021-11-12 23:35:28,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=305, Invalid=1587, Unknown=0, NotChecked=0, Total=1892 [2021-11-12 23:35:28,192 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 347 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 380.87ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.09ms SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 455.16ms IncrementalHoareTripleChecker+Time [2021-11-12 23:35:28,192 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 728 Invalid, 825 Unknown, 0 Unchecked, 8.09ms Time], IncrementalHoareTripleChecker [126 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 455.16ms Time] [2021-11-12 23:35:28,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-11-12 23:35:28,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 196. [2021-11-12 23:35:28,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 153 states have (on average 1.2810457516339868) internal successors, (196), 159 states have internal predecessors, (196), 24 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2021-11-12 23:35:28,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 243 transitions. [2021-11-12 23:35:28,206 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 243 transitions. Word has length 26 [2021-11-12 23:35:28,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:35:28,207 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 243 transitions. [2021-11-12 23:35:28,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.909090909090909) internal successors, (64), 14 states have internal predecessors, (64), 8 states have call successors, (9), 9 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:35:28,207 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 243 transitions. [2021-11-12 23:35:28,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-12 23:35:28,208 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:35:28,208 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:35:28,242 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-12 23:35:28,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-12 23:35:28,431 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-12 23:35:28,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:35:28,432 INFO L85 PathProgramCache]: Analyzing trace with hash 214951410, now seen corresponding path program 1 times [2021-11-12 23:35:28,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:35:28,432 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382767110] [2021-11-12 23:35:28,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:35:28,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:35:28,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:35:28,495 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:35:28,495 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:35:28,495 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382767110] [2021-11-12 23:35:28,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382767110] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:35:28,496 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452699545] [2021-11-12 23:35:28,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:35:28,496 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:35:28,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:35:28,497 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:35:28,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-12 23:35:28,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:35:28,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-12 23:35:28,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:35:28,636 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-12 23:35:28,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:35:28,713 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-12 23:35:28,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452699545] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-12 23:35:28,714 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [607567276] [2021-11-12 23:35:28,719 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2021-11-12 23:35:28,720 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:35:28,720 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-12 23:35:28,721 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-12 23:35:28,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2021-11-12 23:35:28,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135755309] [2021-11-12 23:35:28,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-12 23:35:28,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-12 23:35:28,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:35:28,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-12 23:35:28,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-11-12 23:35:28,724 INFO L87 Difference]: Start difference. First operand 196 states and 243 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 7 states have internal predecessors, (39), 6 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-12 23:35:28,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:35:28,814 INFO L93 Difference]: Finished difference Result 210 states and 258 transitions. [2021-11-12 23:35:28,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-12 23:35:28,815 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 7 states have internal predecessors, (39), 6 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2021-11-12 23:35:28,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:35:28,817 INFO L225 Difference]: With dead ends: 210 [2021-11-12 23:35:28,817 INFO L226 Difference]: Without dead ends: 162 [2021-11-12 23:35:28,818 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2021-11-12 23:35:28,818 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 59 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.47ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.64ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.30ms IncrementalHoareTripleChecker+Time [2021-11-12 23:35:28,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 374 Invalid, 76 Unknown, 0 Unchecked, 1.64ms Time], IncrementalHoareTripleChecker [8 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 53.30ms Time] [2021-11-12 23:35:28,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-11-12 23:35:28,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 158. [2021-11-12 23:35:28,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 124 states have (on average 1.2338709677419355) internal successors, (153), 128 states have internal predecessors, (153), 19 states have call successors, (19), 11 states have call predecessors, (19), 10 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-11-12 23:35:28,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 190 transitions. [2021-11-12 23:35:28,836 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 190 transitions. Word has length 30 [2021-11-12 23:35:28,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:35:28,836 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 190 transitions. [2021-11-12 23:35:28,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 7 states have internal predecessors, (39), 6 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-12 23:35:28,837 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 190 transitions. [2021-11-12 23:35:28,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-12 23:35:28,839 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:35:28,839 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:35:28,880 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-12 23:35:29,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:35:29,054 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-12 23:35:29,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:35:29,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1031540798, now seen corresponding path program 1 times [2021-11-12 23:35:29,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:35:29,055 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008634472] [2021-11-12 23:35:29,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:35:29,055 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:35:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:35:29,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-12 23:35:29,106 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:35:29,106 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008634472] [2021-11-12 23:35:29,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008634472] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:35:29,106 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757696618] [2021-11-12 23:35:29,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:35:29,107 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:35:29,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:35:29,108 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:35:29,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-12 23:35:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:35:29,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-12 23:35:29,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:35:29,271 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-12 23:35:29,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:35:29,350 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-12 23:35:29,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757696618] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-12 23:35:29,350 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1313816883] [2021-11-12 23:35:29,354 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2021-11-12 23:35:29,355 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:35:29,355 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-12 23:35:29,356 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-12 23:35:29,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2021-11-12 23:35:29,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613734987] [2021-11-12 23:35:29,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-12 23:35:29,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-12 23:35:29,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:35:29,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-12 23:35:29,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-11-12 23:35:29,358 INFO L87 Difference]: Start difference. First operand 158 states and 190 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-12 23:35:29,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:35:29,495 INFO L93 Difference]: Finished difference Result 172 states and 208 transitions. [2021-11-12 23:35:29,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-12 23:35:29,496 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2021-11-12 23:35:29,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:35:29,497 INFO L225 Difference]: With dead ends: 172 [2021-11-12 23:35:29,497 INFO L226 Difference]: Without dead ends: 160 [2021-11-12 23:35:29,498 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2021-11-12 23:35:29,498 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 52 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.07ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.87ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 55.25ms IncrementalHoareTripleChecker+Time [2021-11-12 23:35:29,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 505 Invalid, 125 Unknown, 0 Unchecked, 1.87ms Time], IncrementalHoareTripleChecker [12 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 55.25ms Time] [2021-11-12 23:35:29,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-11-12 23:35:29,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2021-11-12 23:35:29,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 124 states have (on average 1.2258064516129032) internal successors, (152), 128 states have internal predecessors, (152), 19 states have call successors, (19), 11 states have call predecessors, (19), 10 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-11-12 23:35:29,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 189 transitions. [2021-11-12 23:35:29,510 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 189 transitions. Word has length 29 [2021-11-12 23:35:29,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:35:29,510 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 189 transitions. [2021-11-12 23:35:29,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-12 23:35:29,510 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 189 transitions. [2021-11-12 23:35:29,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-12 23:35:29,511 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:35:29,511 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:35:29,546 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-11-12 23:35:29,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-12 23:35:29,736 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-12 23:35:29,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:35:29,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1897863652, now seen corresponding path program 1 times [2021-11-12 23:35:29,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:35:29,736 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092516046] [2021-11-12 23:35:29,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:35:29,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:35:29,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:35:29,782 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:35:29,783 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:35:29,783 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092516046] [2021-11-12 23:35:29,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092516046] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:35:29,783 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860585311] [2021-11-12 23:35:29,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:35:29,783 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:35:29,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:35:29,800 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:35:29,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-12 23:35:29,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:35:29,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-12 23:35:29,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:35:29,924 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:35:29,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:35:30,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:35:30,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860585311] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-12 23:35:30,023 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1142483857] [2021-11-12 23:35:30,027 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2021-11-12 23:35:30,027 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:35:30,028 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-12 23:35:30,029 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-12 23:35:30,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2021-11-12 23:35:30,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920082614] [2021-11-12 23:35:30,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-12 23:35:30,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-12 23:35:30,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:35:30,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-12 23:35:30,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-11-12 23:35:30,033 INFO L87 Difference]: Start difference. First operand 158 states and 189 transitions. Second operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-12 23:35:30,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:35:30,106 INFO L93 Difference]: Finished difference Result 168 states and 201 transitions. [2021-11-12 23:35:30,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-12 23:35:30,107 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2021-11-12 23:35:30,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:35:30,109 INFO L225 Difference]: With dead ends: 168 [2021-11-12 23:35:30,109 INFO L226 Difference]: Without dead ends: 167 [2021-11-12 23:35:30,110 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2021-11-12 23:35:30,110 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 31 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.11ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.45ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.39ms IncrementalHoareTripleChecker+Time [2021-11-12 23:35:30,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 479 Invalid, 71 Unknown, 0 Unchecked, 1.45ms Time], IncrementalHoareTripleChecker [10 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 32.39ms Time] [2021-11-12 23:35:30,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-11-12 23:35:30,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2021-11-12 23:35:30,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 129 states have (on average 1.2170542635658914) internal successors, (157), 132 states have internal predecessors, (157), 19 states have call successors, (19), 11 states have call predecessors, (19), 11 states have return successors, (20), 20 states have call predecessors, (20), 18 states have call successors, (20) [2021-11-12 23:35:30,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 196 transitions. [2021-11-12 23:35:30,126 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 196 transitions. Word has length 30 [2021-11-12 23:35:30,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:35:30,127 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 196 transitions. [2021-11-12 23:35:30,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-12 23:35:30,127 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 196 transitions. [2021-11-12 23:35:30,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:35:30,128 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:35:30,128 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:35:30,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-12 23:35:30,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-12 23:35:30,344 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-12 23:35:30,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:35:30,344 INFO L85 PathProgramCache]: Analyzing trace with hash 945477369, now seen corresponding path program 2 times [2021-11-12 23:35:30,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:35:30,344 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291222934] [2021-11-12 23:35:30,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:35:30,345 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:35:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:35:30,439 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:35:30,440 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:35:30,440 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291222934] [2021-11-12 23:35:30,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291222934] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:35:30,440 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870803721] [2021-11-12 23:35:30,440 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-12 23:35:30,441 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:35:30,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:35:30,442 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:35:30,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-12 23:35:30,499 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-12 23:35:30,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-12 23:35:30,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-12 23:35:30,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:35:30,673 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-12 23:35:30,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:35:30,890 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-12 23:35:30,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870803721] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-12 23:35:30,891 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [223590513] [2021-11-12 23:35:30,893 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2021-11-12 23:35:30,893 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:35:30,893 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-12 23:35:30,894 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-12 23:35:30,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25 [2021-11-12 23:35:30,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14018391] [2021-11-12 23:35:30,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-12 23:35:30,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-12 23:35:30,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:35:30,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-12 23:35:30,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2021-11-12 23:35:30,898 INFO L87 Difference]: Start difference. First operand 164 states and 196 transitions. Second operand has 26 states, 25 states have (on average 2.88) internal successors, (72), 16 states have internal predecessors, (72), 11 states have call successors, (12), 10 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:35:31,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:35:31,669 INFO L93 Difference]: Finished difference Result 220 states and 275 transitions. [2021-11-12 23:35:31,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-12 23:35:31,670 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.88) internal successors, (72), 16 states have internal predecessors, (72), 11 states have call successors, (12), 10 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-12 23:35:31,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:35:31,672 INFO L225 Difference]: With dead ends: 220 [2021-11-12 23:35:31,672 INFO L226 Difference]: Without dead ends: 218 [2021-11-12 23:35:31,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=338, Invalid=1642, Unknown=0, NotChecked=0, Total=1980 [2021-11-12 23:35:31,673 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 278 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 329.70ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.68ms SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 398.45ms IncrementalHoareTripleChecker+Time [2021-11-12 23:35:31,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 598 Invalid, 830 Unknown, 0 Unchecked, 5.68ms Time], IncrementalHoareTripleChecker [91 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 398.45ms Time] [2021-11-12 23:35:31,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-11-12 23:35:31,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 193. [2021-11-12 23:35:31,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 153 states have (on average 1.2091503267973855) internal successors, (185), 155 states have internal predecessors, (185), 23 states have call successors, (23), 13 states have call predecessors, (23), 13 states have return successors, (24), 24 states have call predecessors, (24), 22 states have call successors, (24) [2021-11-12 23:35:31,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 232 transitions. [2021-11-12 23:35:31,692 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 232 transitions. Word has length 31 [2021-11-12 23:35:31,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:35:31,694 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 232 transitions. [2021-11-12 23:35:31,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.88) internal successors, (72), 16 states have internal predecessors, (72), 11 states have call successors, (12), 10 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:35:31,694 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 232 transitions. [2021-11-12 23:35:31,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-12 23:35:31,695 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:35:31,695 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:35:31,732 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-12 23:35:31,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:35:31,916 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-12 23:35:31,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:35:31,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1295769026, now seen corresponding path program 1 times [2021-11-12 23:35:31,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:35:31,916 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238779358] [2021-11-12 23:35:31,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:35:31,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:35:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:35:31,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:35:31,965 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:35:31,965 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238779358] [2021-11-12 23:35:31,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238779358] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:35:31,965 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647455650] [2021-11-12 23:35:31,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:35:31,965 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:35:31,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:35:31,978 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:35:31,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-12 23:35:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:35:32,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-12 23:35:32,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:35:32,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:35:32,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:35:32,214 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:35:32,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647455650] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-12 23:35:32,214 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1166336447] [2021-11-12 23:35:32,216 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2021-11-12 23:35:32,217 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:35:32,217 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-12 23:35:32,218 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-12 23:35:32,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2021-11-12 23:35:32,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402213723] [2021-11-12 23:35:32,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-12 23:35:32,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-12 23:35:32,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:35:32,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-12 23:35:32,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-11-12 23:35:32,220 INFO L87 Difference]: Start difference. First operand 193 states and 232 transitions. Second operand has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-12 23:35:32,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:35:32,296 INFO L93 Difference]: Finished difference Result 195 states and 235 transitions. [2021-11-12 23:35:32,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-12 23:35:32,296 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2021-11-12 23:35:32,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:35:32,298 INFO L225 Difference]: With dead ends: 195 [2021-11-12 23:35:32,298 INFO L226 Difference]: Without dead ends: 190 [2021-11-12 23:35:32,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2021-11-12 23:35:32,299 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 38 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.19ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.22ms SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.79ms IncrementalHoareTripleChecker+Time [2021-11-12 23:35:32,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 361 Invalid, 66 Unknown, 0 Unchecked, 1.22ms Time], IncrementalHoareTripleChecker [17 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 30.79ms Time] [2021-11-12 23:35:32,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-11-12 23:35:32,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2021-11-12 23:35:32,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 150 states have (on average 1.2) internal successors, (180), 152 states have internal predecessors, (180), 23 states have call successors, (23), 13 states have call predecessors, (23), 13 states have return successors, (23), 23 states have call predecessors, (23), 22 states have call successors, (23) [2021-11-12 23:35:32,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 226 transitions. [2021-11-12 23:35:32,311 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 226 transitions. Word has length 31 [2021-11-12 23:35:32,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:35:32,312 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 226 transitions. [2021-11-12 23:35:32,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-12 23:35:32,312 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 226 transitions. [2021-11-12 23:35:32,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-12 23:35:32,313 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:35:32,313 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:35:32,349 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-12 23:35:32,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-12 23:35:32,527 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-12 23:35:32,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:35:32,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1342949058, now seen corresponding path program 1 times [2021-11-12 23:35:32,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:35:32,528 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115336784] [2021-11-12 23:35:32,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:35:32,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:35:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:35:32,556 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-12 23:35:32,556 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:35:32,557 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115336784] [2021-11-12 23:35:32,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115336784] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:35:32,557 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239025337] [2021-11-12 23:35:32,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:35:32,557 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:35:32,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:35:32,558 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:35:32,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-12 23:35:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:35:32,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-12 23:35:32,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:35:32,689 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-12 23:35:32,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:35:32,780 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-12 23:35:32,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239025337] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-12 23:35:32,781 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [935518769] [2021-11-12 23:35:32,786 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2021-11-12 23:35:32,786 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:35:32,787 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-12 23:35:32,788 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-12 23:35:32,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-11-12 23:35:32,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13945883] [2021-11-12 23:35:32,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-12 23:35:32,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-12 23:35:32,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:35:32,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-12 23:35:32,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-12 23:35:32,794 INFO L87 Difference]: Start difference. First operand 189 states and 226 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (5), 3 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:35:32,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:35:32,885 INFO L93 Difference]: Finished difference Result 348 states and 429 transitions. [2021-11-12 23:35:32,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-12 23:35:32,886 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (5), 3 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-12 23:35:32,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:35:32,888 INFO L225 Difference]: With dead ends: 348 [2021-11-12 23:35:32,888 INFO L226 Difference]: Without dead ends: 178 [2021-11-12 23:35:32,889 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-11-12 23:35:32,890 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 43 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.33ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.61ms IncrementalHoareTripleChecker+Time [2021-11-12 23:35:32,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 272 Invalid, 97 Unknown, 0 Unchecked, 1.33ms Time], IncrementalHoareTripleChecker [15 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 53.61ms Time] [2021-11-12 23:35:32,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-11-12 23:35:32,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 165. [2021-11-12 23:35:32,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 132 states have (on average 1.1515151515151516) internal successors, (152), 133 states have internal predecessors, (152), 19 states have call successors, (19), 12 states have call predecessors, (19), 12 states have return successors, (19), 19 states have call predecessors, (19), 18 states have call successors, (19) [2021-11-12 23:35:32,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 190 transitions. [2021-11-12 23:35:32,934 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 190 transitions. Word has length 37 [2021-11-12 23:35:32,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:35:32,934 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 190 transitions. [2021-11-12 23:35:32,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (5), 3 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:35:32,935 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 190 transitions. [2021-11-12 23:35:32,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-12 23:35:32,935 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:35:32,936 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:35:32,973 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-12 23:35:33,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:35:33,152 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting multiple_ofErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-12 23:35:33,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:35:33,152 INFO L85 PathProgramCache]: Analyzing trace with hash 2084074982, now seen corresponding path program 1 times [2021-11-12 23:35:33,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:35:33,152 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389650921] [2021-11-12 23:35:33,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:35:33,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:35:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:35:33,239 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-12 23:35:33,239 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:35:33,239 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389650921] [2021-11-12 23:35:33,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389650921] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:35:33,240 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728932880] [2021-11-12 23:35:33,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:35:33,240 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:35:33,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:35:33,244 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:35:33,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-12 23:35:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:35:33,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-12 23:35:33,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:35:33,497 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-12 23:35:33,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:35:33,671 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-12 23:35:33,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728932880] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-12 23:35:33,672 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-12 23:35:33,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11, 7] total 23 [2021-11-12 23:35:33,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886544186] [2021-11-12 23:35:33,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-12 23:35:33,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-12 23:35:33,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:35:33,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-12 23:35:33,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2021-11-12 23:35:33,673 INFO L87 Difference]: Start difference. First operand 165 states and 190 transitions. Second operand has 8 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:35:33,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:35:33,842 INFO L93 Difference]: Finished difference Result 171 states and 198 transitions. [2021-11-12 23:35:33,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-12 23:35:33,843 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-11-12 23:35:33,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:35:33,844 INFO L225 Difference]: With dead ends: 171 [2021-11-12 23:35:33,844 INFO L226 Difference]: Without dead ends: 170 [2021-11-12 23:35:33,845 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2021-11-12 23:35:33,846 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 52 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 62.38ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.51ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 76.29ms IncrementalHoareTripleChecker+Time [2021-11-12 23:35:33,846 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 274 Invalid, 140 Unknown, 0 Unchecked, 1.51ms Time], IncrementalHoareTripleChecker [20 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 76.29ms Time] [2021-11-12 23:35:33,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-11-12 23:35:33,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 164. [2021-11-12 23:35:33,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 132 states have (on average 1.121212121212121) internal successors, (148), 132 states have internal predecessors, (148), 19 states have call successors, (19), 12 states have call predecessors, (19), 12 states have return successors, (19), 19 states have call predecessors, (19), 18 states have call successors, (19) [2021-11-12 23:35:33,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 186 transitions. [2021-11-12 23:35:33,866 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 186 transitions. Word has length 39 [2021-11-12 23:35:33,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:35:33,866 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 186 transitions. [2021-11-12 23:35:33,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-12 23:35:33,867 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 186 transitions. [2021-11-12 23:35:33,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-12 23:35:33,867 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:35:33,868 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:35:33,900 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-12 23:35:34,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:35:34,084 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-12 23:35:34,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:35:34,084 INFO L85 PathProgramCache]: Analyzing trace with hash -794105240, now seen corresponding path program 1 times [2021-11-12 23:35:34,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:35:34,084 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461350939] [2021-11-12 23:35:34,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:35:34,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:35:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:35:34,183 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-12 23:35:34,183 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:35:34,184 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461350939] [2021-11-12 23:35:34,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461350939] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:35:34,184 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613631143] [2021-11-12 23:35:34,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:35:34,184 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:35:34,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:35:34,185 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:35:34,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-12 23:35:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:35:34,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-12 23:35:34,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:35:34,392 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-12 23:35:34,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:35:34,669 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-12 23:35:34,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613631143] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-12 23:35:34,669 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1566286148] [2021-11-12 23:35:34,672 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2021-11-12 23:35:34,672 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:35:34,672 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-12 23:35:34,673 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-12 23:35:34,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2021-11-12 23:35:34,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985573000] [2021-11-12 23:35:34,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-12 23:35:34,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-12 23:35:34,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:35:34,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-12 23:35:34,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2021-11-12 23:35:34,675 INFO L87 Difference]: Start difference. First operand 164 states and 186 transitions. Second operand has 20 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 18 states have internal predecessors, (63), 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-12 23:35:34,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:35:34,864 INFO L93 Difference]: Finished difference Result 179 states and 204 transitions. [2021-11-12 23:35:34,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-12 23:35:34,864 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 18 states have internal predecessors, (63), 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 42 [2021-11-12 23:35:34,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:35:34,866 INFO L225 Difference]: With dead ends: 179 [2021-11-12 23:35:34,866 INFO L226 Difference]: Without dead ends: 174 [2021-11-12 23:35:34,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2021-11-12 23:35:34,867 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 72 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 60.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.20ms SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 70.52ms IncrementalHoareTripleChecker+Time [2021-11-12 23:35:34,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 664 Invalid, 150 Unknown, 0 Unchecked, 2.20ms Time], IncrementalHoareTripleChecker [34 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 70.52ms Time] [2021-11-12 23:35:34,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-11-12 23:35:34,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2021-11-12 23:35:34,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 140 states have (on average 1.1142857142857143) internal successors, (156), 140 states have internal predecessors, (156), 19 states have call successors, (19), 12 states have call predecessors, (19), 14 states have return successors, (21), 21 states have call predecessors, (21), 18 states have call successors, (21) [2021-11-12 23:35:34,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 196 transitions. [2021-11-12 23:35:34,876 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 196 transitions. Word has length 42 [2021-11-12 23:35:34,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:35:34,877 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 196 transitions. [2021-11-12 23:35:34,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 18 states have internal predecessors, (63), 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-12 23:35:34,877 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 196 transitions. [2021-11-12 23:35:34,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-12 23:35:34,878 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:35:34,878 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:35:34,915 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-12 23:35:35,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:35:35,104 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-12 23:35:35,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:35:35,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1545418984, now seen corresponding path program 2 times [2021-11-12 23:35:35,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:35:35,104 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996050397] [2021-11-12 23:35:35,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:35:35,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:35:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:35:35,282 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-12 23:35:35,282 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:35:35,282 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996050397] [2021-11-12 23:35:35,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996050397] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:35:35,282 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248281527] [2021-11-12 23:35:35,282 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-12 23:35:35,283 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:35:35,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:35:35,284 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:35:35,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-12 23:35:35,351 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-11-12 23:35:35,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-12 23:35:35,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-12 23:35:35,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:35:35,672 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-12 23:35:35,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:35:36,624 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 6 proven. 123 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-12 23:35:36,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248281527] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-12 23:35:36,624 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1021633495] [2021-11-12 23:35:36,626 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2021-11-12 23:35:36,627 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:35:36,627 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-12 23:35:36,628 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-12 23:35:36,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 15] total 31 [2021-11-12 23:35:36,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676364410] [2021-11-12 23:35:36,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-12 23:35:36,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-12 23:35:36,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:35:36,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-12 23:35:36,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=853, Unknown=0, NotChecked=0, Total=992 [2021-11-12 23:35:36,631 INFO L87 Difference]: Start difference. First operand 174 states and 196 transitions. Second operand has 32 states, 31 states have (on average 3.129032258064516) internal successors, (97), 30 states have internal predecessors, (97), 9 states have call successors, (11), 3 states have call predecessors, (11), 9 states have return successors, (13), 13 states have call predecessors, (13), 7 states have call successors, (13) [2021-11-12 23:35:37,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:35:37,132 INFO L93 Difference]: Finished difference Result 203 states and 232 transitions. [2021-11-12 23:35:37,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-12 23:35:37,136 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.129032258064516) internal successors, (97), 30 states have internal predecessors, (97), 9 states have call successors, (11), 3 states have call predecessors, (11), 9 states have return successors, (13), 13 states have call predecessors, (13), 7 states have call successors, (13) Word has length 80 [2021-11-12 23:35:37,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:35:37,137 INFO L225 Difference]: With dead ends: 203 [2021-11-12 23:35:37,137 INFO L226 Difference]: Without dead ends: 194 [2021-11-12 23:35:37,139 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 144 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=389, Invalid=1773, Unknown=0, NotChecked=0, Total=2162 [2021-11-12 23:35:37,139 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 96 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 148.02ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.64ms SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 174.09ms IncrementalHoareTripleChecker+Time [2021-11-12 23:35:37,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 937 Invalid, 348 Unknown, 0 Unchecked, 3.64ms Time], IncrementalHoareTripleChecker [53 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 174.09ms Time] [2021-11-12 23:35:37,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-11-12 23:35:37,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2021-11-12 23:35:37,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 156 states have (on average 1.1025641025641026) internal successors, (172), 156 states have internal predecessors, (172), 19 states have call successors, (19), 12 states have call predecessors, (19), 18 states have return successors, (25), 25 states have call predecessors, (25), 18 states have call successors, (25) [2021-11-12 23:35:37,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 216 transitions. [2021-11-12 23:35:37,177 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 216 transitions. Word has length 80 [2021-11-12 23:35:37,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:35:37,177 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 216 transitions. [2021-11-12 23:35:37,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.129032258064516) internal successors, (97), 30 states have internal predecessors, (97), 9 states have call successors, (11), 3 states have call predecessors, (11), 9 states have return successors, (13), 13 states have call predecessors, (13), 7 states have call successors, (13) [2021-11-12 23:35:37,178 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 216 transitions. [2021-11-12 23:35:37,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-11-12 23:35:37,180 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:35:37,180 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:35:37,217 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-12 23:35:37,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-11-12 23:35:37,395 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-12 23:35:37,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:35:37,396 INFO L85 PathProgramCache]: Analyzing trace with hash 985846760, now seen corresponding path program 3 times [2021-11-12 23:35:37,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:35:37,396 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712343680] [2021-11-12 23:35:37,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:35:37,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:35:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:35:37,726 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-11-12 23:35:37,726 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:35:37,726 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712343680] [2021-11-12 23:35:37,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712343680] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:35:37,726 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173329934] [2021-11-12 23:35:37,726 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-12 23:35:37,727 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:35:37,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:35:37,732 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:35:37,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-12 23:35:37,807 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-12 23:35:37,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-12 23:35:37,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-12 23:35:37,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:35:38,574 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-11-12 23:35:38,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:35:46,378 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (or (< v_mult_~n_BEFORE_CALL_30 |c_mult_#in~n|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (<= (+ |c_mult_#res| v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_30) 2147483647) (exists ((aux_mod_v_mult_~n_BEFORE_CALL_29_75 Int) (aux_mod_aux_div_v_mult_~n_BEFORE_CALL_29_75_65 Int) (aux_div_aux_div_v_mult_~n_BEFORE_CALL_29_75_65 Int)) (and (<= 0 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_29_75_65) (<= (+ |v_mult_#in~n_BEFORE_CALL_16| (* 4 aux_div_aux_div_v_mult_~n_BEFORE_CALL_29_75_65) (* 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_29_75_65) aux_mod_v_mult_~n_BEFORE_CALL_29_75 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_29_75) (< aux_div_aux_div_v_mult_~n_BEFORE_CALL_29_75_65 v_mult_~n_BEFORE_CALL_30) (<= 4294967292 (+ (* 8 aux_div_aux_div_v_mult_~n_BEFORE_CALL_29_75_65) (* 2 aux_mod_v_mult_~n_BEFORE_CALL_29_75) (* 4 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_29_75_65) (* 6 v_mult_~n_BEFORE_CALL_30) (div (+ (* v_mult_~n_BEFORE_CALL_30 6) (* aux_div_aux_div_v_mult_~n_BEFORE_CALL_29_75_65 8) (* aux_mod_v_mult_~n_BEFORE_CALL_29_75 2) (* aux_mod_aux_div_v_mult_~n_BEFORE_CALL_29_75_65 4) (- 2147483646)) 3))) (< aux_mod_aux_div_v_mult_~n_BEFORE_CALL_29_75_65 2) (< aux_mod_v_mult_~n_BEFORE_CALL_29_75 2))))) is different from false [2021-11-12 23:35:49,681 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (or (< v_mult_~n_BEFORE_CALL_30 |c_mult_#in~n|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (exists ((aux_mod_v_mult_~n_BEFORE_CALL_29_75 Int) (aux_mod_aux_div_v_mult_~n_BEFORE_CALL_29_75_65 Int) (aux_div_aux_div_v_mult_~n_BEFORE_CALL_29_75_65 Int)) (and (<= 0 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_29_75_65) (<= (+ |v_mult_#in~n_BEFORE_CALL_16| (* 4 aux_div_aux_div_v_mult_~n_BEFORE_CALL_29_75_65) (* 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_29_75_65) aux_mod_v_mult_~n_BEFORE_CALL_29_75 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_29_75) (< aux_div_aux_div_v_mult_~n_BEFORE_CALL_29_75_65 v_mult_~n_BEFORE_CALL_30) (<= 4294967292 (+ (* 8 aux_div_aux_div_v_mult_~n_BEFORE_CALL_29_75_65) (* 2 aux_mod_v_mult_~n_BEFORE_CALL_29_75) (* 4 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_29_75_65) (* 6 v_mult_~n_BEFORE_CALL_30) (div (+ (* v_mult_~n_BEFORE_CALL_30 6) (* aux_div_aux_div_v_mult_~n_BEFORE_CALL_29_75_65 8) (* aux_mod_v_mult_~n_BEFORE_CALL_29_75 2) (* aux_mod_aux_div_v_mult_~n_BEFORE_CALL_29_75_65 4) (- 2147483646)) 3))) (< aux_mod_aux_div_v_mult_~n_BEFORE_CALL_29_75_65 2) (< aux_mod_v_mult_~n_BEFORE_CALL_29_75 2))) (<= (+ |c_mult_#t~ret8| v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_30 c_mult_~n) 2147483647))) is different from false [2021-11-12 23:35:54,573 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_29 Int) (|v_mult_#in~n_BEFORE_CALL_16| Int) (|v_mult_#in~n_247| Int) (v_mult_~n_BEFORE_CALL_30 Int)) (or (< v_mult_~n_BEFORE_CALL_30 |c_mult_#in~n|) (< (div (+ (* v_mult_~n_BEFORE_CALL_29 (- 2)) 2147483646) 3) (* 2 v_mult_~n_BEFORE_CALL_29)) (< v_mult_~n_BEFORE_CALL_29 |v_mult_#in~n_BEFORE_CALL_16|) (< c_mult_~n |v_mult_#in~n_247|) (exists ((aux_mod_v_mult_~n_BEFORE_CALL_29_75 Int) (aux_mod_aux_div_v_mult_~n_BEFORE_CALL_29_75_65 Int) (aux_div_aux_div_v_mult_~n_BEFORE_CALL_29_75_65 Int)) (and (<= 0 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_29_75_65) (<= (+ |v_mult_#in~n_BEFORE_CALL_16| (* 4 aux_div_aux_div_v_mult_~n_BEFORE_CALL_29_75_65) (* 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_29_75_65) aux_mod_v_mult_~n_BEFORE_CALL_29_75 (* 3 v_mult_~n_BEFORE_CALL_30)) 2147483646) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_29_75) (< aux_div_aux_div_v_mult_~n_BEFORE_CALL_29_75_65 v_mult_~n_BEFORE_CALL_30) (<= 4294967292 (+ (* 8 aux_div_aux_div_v_mult_~n_BEFORE_CALL_29_75_65) (* 2 aux_mod_v_mult_~n_BEFORE_CALL_29_75) (* 4 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_29_75_65) (* 6 v_mult_~n_BEFORE_CALL_30) (div (+ (* v_mult_~n_BEFORE_CALL_30 6) (* aux_div_aux_div_v_mult_~n_BEFORE_CALL_29_75_65 8) (* aux_mod_v_mult_~n_BEFORE_CALL_29_75 2) (* aux_mod_aux_div_v_mult_~n_BEFORE_CALL_29_75_65 4) (- 2147483646)) 3))) (< aux_mod_aux_div_v_mult_~n_BEFORE_CALL_29_75_65 2) (< aux_mod_v_mult_~n_BEFORE_CALL_29_75 2))) (<= (+ v_mult_~n_BEFORE_CALL_29 v_mult_~n_BEFORE_CALL_30 (* 5 |v_mult_#in~n_247|) c_mult_~n) 2147483646))) is different from false [2021-11-12 23:35:54,592 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_29, |v_mult_#in~n_BEFORE_CALL_16|, v_mult_~n_BEFORE_CALL_30] [2021-11-12 23:35:54,592 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [913365535] [2021-11-12 23:35:54,595 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2021-11-12 23:35:54,595 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:35:54,596 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-12 23:35:54,597 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-12 23:35:54,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2021-11-12 23:35:54,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088112325] [2021-11-12 23:35:54,598 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-12 23:35:54,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-12 23:35:54,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:35:54,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-12 23:35:54,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1134, Unknown=4, NotChecked=210, Total=1482 [2021-11-12 23:35:54,600 INFO L87 Difference]: Start difference. First operand 194 states and 216 transitions. Second operand has 22 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 4 states have call successors, (4), 2 states have call predecessors, (4), 9 states have return successors, (9), 9 states have call predecessors, (9), 3 states have call successors, (9) [2021-11-12 23:35:55,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:35:55,446 INFO L93 Difference]: Finished difference Result 203 states and 226 transitions. [2021-11-12 23:35:55,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-12 23:35:55,448 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 4 states have call successors, (4), 2 states have call predecessors, (4), 9 states have return successors, (9), 9 states have call predecessors, (9), 3 states have call successors, (9) Word has length 114 [2021-11-12 23:35:55,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:35:55,449 INFO L225 Difference]: With dead ends: 203 [2021-11-12 23:35:55,449 INFO L226 Difference]: Without dead ends: 200 [2021-11-12 23:35:55,451 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 113 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=325, Invalid=2439, Unknown=4, NotChecked=312, Total=3080 [2021-11-12 23:35:55,452 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 104 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 313.77ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.95ms SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 384.46ms IncrementalHoareTripleChecker+Time [2021-11-12 23:35:55,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 1159 Invalid, 649 Unknown, 0 Unchecked, 5.95ms Time], IncrementalHoareTripleChecker [59 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 384.46ms Time] [2021-11-12 23:35:55,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-11-12 23:35:55,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2021-11-12 23:35:55,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 160 states have (on average 1.1) internal successors, (176), 160 states have internal predecessors, (176), 19 states have call successors, (19), 12 states have call predecessors, (19), 19 states have return successors, (26), 26 states have call predecessors, (26), 18 states have call successors, (26) [2021-11-12 23:35:55,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 221 transitions. [2021-11-12 23:35:55,465 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 221 transitions. Word has length 114 [2021-11-12 23:35:55,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:35:55,466 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 221 transitions. [2021-11-12 23:35:55,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 4 states have call successors, (4), 2 states have call predecessors, (4), 9 states have return successors, (9), 9 states have call predecessors, (9), 3 states have call successors, (9) [2021-11-12 23:35:55,466 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 221 transitions. [2021-11-12 23:35:55,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-11-12 23:35:55,468 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:35:55,468 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:35:55,515 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-12 23:35:55,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-11-12 23:35:55,696 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-12 23:35:55,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:35:55,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1876261404, now seen corresponding path program 4 times [2021-11-12 23:35:55,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:35:55,696 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31830282] [2021-11-12 23:35:55,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:35:55,697 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:35:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:35:56,218 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2021-11-12 23:35:56,218 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:35:56,219 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31830282] [2021-11-12 23:35:56,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31830282] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:35:56,219 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015496341] [2021-11-12 23:35:56,219 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-12 23:35:56,219 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:35:56,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:35:56,220 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:35:56,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-12 23:35:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:35:56,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 42 conjunts are in the unsatisfiable core [2021-11-12 23:35:56,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:35:57,467 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2021-11-12 23:35:57,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:36:02,101 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_43] [2021-11-12 23:36:02,101 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1386692417] [2021-11-12 23:36:02,103 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2021-11-12 23:36:02,104 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:36:02,104 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-12 23:36:02,106 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-12 23:36:02,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2021-11-12 23:36:02,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301175052] [2021-11-12 23:36:02,106 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-12 23:36:02,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-12 23:36:02,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:36:02,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-12 23:36:02,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1342, Unknown=0, NotChecked=0, Total=1482 [2021-11-12 23:36:02,109 INFO L87 Difference]: Start difference. First operand 199 states and 221 transitions. Second operand has 24 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 4 states have call successors, (5), 2 states have call predecessors, (5), 10 states have return successors, (10), 10 states have call predecessors, (10), 3 states have call successors, (10) [2021-11-12 23:36:03,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:36:03,195 INFO L93 Difference]: Finished difference Result 208 states and 231 transitions. [2021-11-12 23:36:03,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-12 23:36:03,196 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 4 states have call successors, (5), 2 states have call predecessors, (5), 10 states have return successors, (10), 10 states have call predecessors, (10), 3 states have call successors, (10) Word has length 140 [2021-11-12 23:36:03,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:36:03,200 INFO L225 Difference]: With dead ends: 208 [2021-11-12 23:36:03,200 INFO L226 Difference]: Without dead ends: 205 [2021-11-12 23:36:03,202 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 139 SyntacticMatches, 7 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=354, Invalid=2952, Unknown=0, NotChecked=0, Total=3306 [2021-11-12 23:36:03,203 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 114 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 399.77ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.51ms SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 477.93ms IncrementalHoareTripleChecker+Time [2021-11-12 23:36:03,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 1343 Invalid, 803 Unknown, 0 Unchecked, 6.51ms Time], IncrementalHoareTripleChecker [65 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 477.93ms Time] [2021-11-12 23:36:03,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-11-12 23:36:03,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2021-11-12 23:36:03,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 164 states have (on average 1.0975609756097562) internal successors, (180), 164 states have internal predecessors, (180), 19 states have call successors, (19), 12 states have call predecessors, (19), 20 states have return successors, (27), 27 states have call predecessors, (27), 18 states have call successors, (27) [2021-11-12 23:36:03,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 226 transitions. [2021-11-12 23:36:03,219 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 226 transitions. Word has length 140 [2021-11-12 23:36:03,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:36:03,220 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 226 transitions. [2021-11-12 23:36:03,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 4 states have call successors, (5), 2 states have call predecessors, (5), 10 states have return successors, (10), 10 states have call predecessors, (10), 3 states have call successors, (10) [2021-11-12 23:36:03,221 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 226 transitions. [2021-11-12 23:36:03,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-11-12 23:36:03,227 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:36:03,227 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:36:03,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-12 23:36:03,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:36:03,452 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-12 23:36:03,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:36:03,452 INFO L85 PathProgramCache]: Analyzing trace with hash -369259416, now seen corresponding path program 5 times [2021-11-12 23:36:03,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:36:03,453 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944429569] [2021-11-12 23:36:03,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:36:03,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:36:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:36:03,984 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 0 proven. 310 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2021-11-12 23:36:03,984 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:36:03,984 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944429569] [2021-11-12 23:36:03,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944429569] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:36:03,984 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794042032] [2021-11-12 23:36:03,985 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-12 23:36:03,985 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:36:03,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:36:03,989 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:36:03,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-12 23:36:04,140 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-11-12 23:36:04,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-12 23:36:04,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 42 conjunts are in the unsatisfiable core [2021-11-12 23:36:04,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:36:05,301 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 0 proven. 310 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2021-11-12 23:36:05,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:36:14,476 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_55] [2021-11-12 23:36:14,476 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1396966798] [2021-11-12 23:36:14,478 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2021-11-12 23:36:14,478 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:36:14,479 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-12 23:36:14,479 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-12 23:36:14,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2021-11-12 23:36:14,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437668266] [2021-11-12 23:36:14,479 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-12 23:36:14,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-12 23:36:14,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:36:14,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-12 23:36:14,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1568, Unknown=2, NotChecked=0, Total=1722 [2021-11-12 23:36:14,481 INFO L87 Difference]: Start difference. First operand 204 states and 226 transitions. Second operand has 26 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 4 states have call successors, (4), 2 states have call predecessors, (4), 11 states have return successors, (11), 11 states have call predecessors, (11), 3 states have call successors, (11) [2021-11-12 23:36:15,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:36:15,883 INFO L93 Difference]: Finished difference Result 213 states and 236 transitions. [2021-11-12 23:36:15,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-12 23:36:15,884 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 4 states have call successors, (4), 2 states have call predecessors, (4), 11 states have return successors, (11), 11 states have call predecessors, (11), 3 states have call successors, (11) Word has length 138 [2021-11-12 23:36:15,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:36:15,886 INFO L225 Difference]: With dead ends: 213 [2021-11-12 23:36:15,886 INFO L226 Difference]: Without dead ends: 210 [2021-11-12 23:36:15,888 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 132 SyntacticMatches, 8 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=389, Invalid=3515, Unknown=2, NotChecked=0, Total=3906 [2021-11-12 23:36:15,889 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 124 mSDsluCounter, 1467 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 556.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.33ms SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 650.94ms IncrementalHoareTripleChecker+Time [2021-11-12 23:36:15,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 1485 Invalid, 971 Unknown, 0 Unchecked, 7.33ms Time], IncrementalHoareTripleChecker [73 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 650.94ms Time] [2021-11-12 23:36:15,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-11-12 23:36:15,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2021-11-12 23:36:15,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 168 states have (on average 1.0952380952380953) internal successors, (184), 168 states have internal predecessors, (184), 19 states have call successors, (19), 12 states have call predecessors, (19), 21 states have return successors, (28), 28 states have call predecessors, (28), 18 states have call successors, (28) [2021-11-12 23:36:15,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 231 transitions. [2021-11-12 23:36:15,902 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 231 transitions. Word has length 138 [2021-11-12 23:36:15,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:36:15,903 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 231 transitions. [2021-11-12 23:36:15,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 4 states have call successors, (4), 2 states have call predecessors, (4), 11 states have return successors, (11), 11 states have call predecessors, (11), 3 states have call successors, (11) [2021-11-12 23:36:15,904 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 231 transitions. [2021-11-12 23:36:15,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-11-12 23:36:15,907 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:36:15,907 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:36:15,956 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-12 23:36:16,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-11-12 23:36:16,124 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-12 23:36:16,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:36:16,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1172360092, now seen corresponding path program 6 times [2021-11-12 23:36:16,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:36:16,124 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055392165] [2021-11-12 23:36:16,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:36:16,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:36:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:36:16,780 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2021-11-12 23:36:16,780 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:36:16,780 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055392165] [2021-11-12 23:36:16,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055392165] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:36:16,780 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10471593] [2021-11-12 23:36:16,780 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-12 23:36:16,780 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:36:16,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:36:16,782 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:36:16,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-12 23:36:16,942 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-12 23:36:16,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-12 23:36:16,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 46 conjunts are in the unsatisfiable core [2021-11-12 23:36:16,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:36:18,525 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2021-11-12 23:36:18,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:36:24,465 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_68] [2021-11-12 23:36:24,465 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1844011869] [2021-11-12 23:36:24,467 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2021-11-12 23:36:24,467 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:36:24,468 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-12 23:36:24,469 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-12 23:36:24,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2021-11-12 23:36:24,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168953581] [2021-11-12 23:36:24,469 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-12 23:36:24,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-11-12 23:36:24,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:36:24,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-11-12 23:36:24,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1816, Unknown=0, NotChecked=0, Total=1980 [2021-11-12 23:36:24,473 INFO L87 Difference]: Start difference. First operand 209 states and 231 transitions. Second operand has 28 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 27 states have internal predecessors, (71), 4 states have call successors, (4), 2 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 3 states have call successors, (12) [2021-11-12 23:36:26,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:36:26,096 INFO L93 Difference]: Finished difference Result 218 states and 241 transitions. [2021-11-12 23:36:26,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-12 23:36:26,097 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 27 states have internal predecessors, (71), 4 states have call successors, (4), 2 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 3 states have call successors, (12) Word has length 150 [2021-11-12 23:36:26,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:36:26,099 INFO L225 Difference]: With dead ends: 218 [2021-11-12 23:36:26,099 INFO L226 Difference]: Without dead ends: 215 [2021-11-12 23:36:26,101 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 143 SyntacticMatches, 9 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=424, Invalid=4132, Unknown=0, NotChecked=0, Total=4556 [2021-11-12 23:36:26,102 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 134 mSDsluCounter, 1616 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 629.55ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.76ms SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 746.92ms IncrementalHoareTripleChecker+Time [2021-11-12 23:36:26,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 1631 Invalid, 1154 Unknown, 0 Unchecked, 5.76ms Time], IncrementalHoareTripleChecker [80 Valid, 1074 Invalid, 0 Unknown, 0 Unchecked, 746.92ms Time] [2021-11-12 23:36:26,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-11-12 23:36:26,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 214. [2021-11-12 23:36:26,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 172 states have (on average 1.0930232558139534) internal successors, (188), 172 states have internal predecessors, (188), 19 states have call successors, (19), 12 states have call predecessors, (19), 22 states have return successors, (29), 29 states have call predecessors, (29), 18 states have call successors, (29) [2021-11-12 23:36:26,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 236 transitions. [2021-11-12 23:36:26,114 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 236 transitions. Word has length 150 [2021-11-12 23:36:26,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:36:26,115 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 236 transitions. [2021-11-12 23:36:26,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 27 states have internal predecessors, (71), 4 states have call successors, (4), 2 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 3 states have call successors, (12) [2021-11-12 23:36:26,115 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 236 transitions. [2021-11-12 23:36:26,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-11-12 23:36:26,118 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:36:26,119 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 12, 12, 12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:36:26,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-12 23:36:26,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-11-12 23:36:26,344 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-12 23:36:26,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:36:26,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1208132888, now seen corresponding path program 7 times [2021-11-12 23:36:26,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:36:26,344 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245454878] [2021-11-12 23:36:26,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:36:26,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:36:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:36:27,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2021-11-12 23:36:27,040 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:36:27,040 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245454878] [2021-11-12 23:36:27,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245454878] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:36:27,040 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751362014] [2021-11-12 23:36:27,041 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-12 23:36:27,041 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:36:27,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:36:27,042 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:36:27,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-12 23:36:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:36:27,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 54 conjunts are in the unsatisfiable core [2021-11-12 23:36:27,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:36:28,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2021-11-12 23:36:28,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:37:04,406 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_86, v_mult_~n_BEFORE_CALL_85] [2021-11-12 23:37:04,407 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1715177085] [2021-11-12 23:37:04,409 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2021-11-12 23:37:04,409 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:37:04,409 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-12 23:37:04,411 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-12 23:37:04,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2021-11-12 23:37:04,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012277584] [2021-11-12 23:37:04,411 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-12 23:37:04,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-12 23:37:04,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:37:04,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-12 23:37:04,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=2475, Unknown=7, NotChecked=0, Total=2756 [2021-11-12 23:37:04,414 INFO L87 Difference]: Start difference. First operand 214 states and 236 transitions. Second operand has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 states have internal predecessors, (75), 4 states have call successors, (5), 2 states have call predecessors, (5), 13 states have return successors, (13), 13 states have call predecessors, (13), 3 states have call successors, (13) [2021-11-12 23:37:06,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:37:06,377 INFO L93 Difference]: Finished difference Result 223 states and 246 transitions. [2021-11-12 23:37:06,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-12 23:37:06,378 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 states have internal predecessors, (75), 4 states have call successors, (5), 2 states have call predecessors, (5), 13 states have return successors, (13), 13 states have call predecessors, (13), 3 states have call successors, (13) Word has length 176 [2021-11-12 23:37:06,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:37:06,380 INFO L225 Difference]: With dead ends: 223 [2021-11-12 23:37:06,380 INFO L226 Difference]: Without dead ends: 220 [2021-11-12 23:37:06,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 178 SyntacticMatches, 11 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 26.4s TimeCoverageRelationStatistics Valid=630, Invalid=5369, Unknown=7, NotChecked=0, Total=6006 [2021-11-12 23:37:06,384 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 144 mSDsluCounter, 1769 mSDsCounter, 0 mSdLazyCounter, 1266 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 809.88ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1781 SdHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.28ms SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 922.98ms IncrementalHoareTripleChecker+Time [2021-11-12 23:37:06,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 1781 Invalid, 1352 Unknown, 0 Unchecked, 6.28ms Time], IncrementalHoareTripleChecker [86 Valid, 1266 Invalid, 0 Unknown, 0 Unchecked, 922.98ms Time] [2021-11-12 23:37:06,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-11-12 23:37:06,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 219. [2021-11-12 23:37:06,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 176 states have (on average 1.0909090909090908) internal successors, (192), 176 states have internal predecessors, (192), 19 states have call successors, (19), 12 states have call predecessors, (19), 23 states have return successors, (30), 30 states have call predecessors, (30), 18 states have call successors, (30) [2021-11-12 23:37:06,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 241 transitions. [2021-11-12 23:37:06,396 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 241 transitions. Word has length 176 [2021-11-12 23:37:06,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:37:06,397 INFO L470 AbstractCegarLoop]: Abstraction has 219 states and 241 transitions. [2021-11-12 23:37:06,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 states have internal predecessors, (75), 4 states have call successors, (5), 2 states have call predecessors, (5), 13 states have return successors, (13), 13 states have call predecessors, (13), 3 states have call successors, (13) [2021-11-12 23:37:06,397 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 241 transitions. [2021-11-12 23:37:06,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2021-11-12 23:37:06,401 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:37:06,401 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 13, 13, 13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:37:06,450 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-12 23:37:06,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:37:06,628 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-12 23:37:06,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:37:06,628 INFO L85 PathProgramCache]: Analyzing trace with hash -787470052, now seen corresponding path program 8 times [2021-11-12 23:37:06,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:37:06,628 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052781190] [2021-11-12 23:37:06,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:37:06,628 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:37:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:37:07,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 0 proven. 678 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2021-11-12 23:37:07,725 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:37:07,725 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052781190] [2021-11-12 23:37:07,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052781190] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:37:07,725 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146342784] [2021-11-12 23:37:07,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-12 23:37:07,726 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:37:07,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:37:07,727 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:37:07,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-12 23:37:08,210 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2021-11-12 23:37:08,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-12 23:37:08,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 58 conjunts are in the unsatisfiable core [2021-11-12 23:37:08,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:37:10,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 0 proven. 678 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2021-11-12 23:37:10,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:37:19,757 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [aux_div_v_mult_~n_BEFORE_CALL_103_58, aux_div_aux_mod_v_mult_~n_BEFORE_CALL_103_58_106] [2021-11-12 23:37:19,757 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [675342564] [2021-11-12 23:37:19,759 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2021-11-12 23:37:19,759 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:37:19,760 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-12 23:37:19,761 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-12 23:37:19,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2021-11-12 23:37:19,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352787911] [2021-11-12 23:37:19,762 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-12 23:37:19,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-12 23:37:19,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:37:19,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-12 23:37:19,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2362, Unknown=0, NotChecked=0, Total=2550 [2021-11-12 23:37:19,765 INFO L87 Difference]: Start difference. First operand 219 states and 241 transitions. Second operand has 32 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 31 states have internal predecessors, (79), 4 states have call successors, (5), 2 states have call predecessors, (5), 14 states have return successors, (14), 14 states have call predecessors, (14), 3 states have call successors, (14) [2021-11-12 23:37:21,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:37:21,856 INFO L93 Difference]: Finished difference Result 228 states and 251 transitions. [2021-11-12 23:37:21,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-12 23:37:21,857 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 31 states have internal predecessors, (79), 4 states have call successors, (5), 2 states have call predecessors, (5), 14 states have return successors, (14), 14 states have call predecessors, (14), 3 states have call successors, (14) Word has length 188 [2021-11-12 23:37:21,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:37:21,858 INFO L225 Difference]: With dead ends: 228 [2021-11-12 23:37:21,859 INFO L226 Difference]: Without dead ends: 225 [2021-11-12 23:37:21,861 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 183 SyntacticMatches, 11 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 966 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=494, Invalid=5512, Unknown=0, NotChecked=0, Total=6006 [2021-11-12 23:37:21,862 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 154 mSDsluCounter, 1878 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 840.31ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1889 SdHoareTripleChecker+Invalid, 1563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.61ms SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 979.89ms IncrementalHoareTripleChecker+Time [2021-11-12 23:37:21,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 1889 Invalid, 1563 Unknown, 0 Unchecked, 6.61ms Time], IncrementalHoareTripleChecker [93 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 979.89ms Time] [2021-11-12 23:37:21,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-11-12 23:37:21,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 224. [2021-11-12 23:37:21,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 180 states have (on average 1.0888888888888888) internal successors, (196), 180 states have internal predecessors, (196), 19 states have call successors, (19), 12 states have call predecessors, (19), 24 states have return successors, (31), 31 states have call predecessors, (31), 18 states have call successors, (31) [2021-11-12 23:37:21,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 246 transitions. [2021-11-12 23:37:21,876 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 246 transitions. Word has length 188 [2021-11-12 23:37:21,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:37:21,876 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 246 transitions. [2021-11-12 23:37:21,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 31 states have internal predecessors, (79), 4 states have call successors, (5), 2 states have call predecessors, (5), 14 states have return successors, (14), 14 states have call predecessors, (14), 3 states have call successors, (14) [2021-11-12 23:37:21,877 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 246 transitions. [2021-11-12 23:37:21,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-11-12 23:37:21,880 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:37:21,880 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:37:21,926 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-11-12 23:37:22,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-11-12 23:37:22,104 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-12 23:37:22,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:37:22,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1947263640, now seen corresponding path program 9 times [2021-11-12 23:37:22,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:37:22,104 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719620099] [2021-11-12 23:37:22,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:37:22,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:37:22,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:37:23,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2021-11-12 23:37:23,242 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:37:23,242 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719620099] [2021-11-12 23:37:23,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719620099] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:37:23,243 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511818151] [2021-11-12 23:37:23,243 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-12 23:37:23,243 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:37:23,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:37:23,244 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:37:23,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-12 23:37:23,655 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-12 23:37:23,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-12 23:37:23,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 58 conjunts are in the unsatisfiable core [2021-11-12 23:37:23,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:37:25,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2021-11-12 23:37:25,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:38:32,458 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_mult_#in~n_BEFORE_CALL_88| Int) (v_mult_~n_BEFORE_CALL_119 Int) (v_mult_~n_BEFORE_CALL_120 Int)) (or (exists ((|v_mult_#in~n_2554| Int) (aux_div_v_mult_~n_BEFORE_CALL_119_136 Int) (aux_mod_v_mult_~n_BEFORE_CALL_119_136 Int) (|v_mult_#in~n_2556| Int)) (and (<= |v_mult_#in~n_2556| |v_mult_#in~n_2554|) (<= (+ v_mult_~n_BEFORE_CALL_120 |v_mult_#in~n_BEFORE_CALL_88| (* 3 aux_div_v_mult_~n_BEFORE_CALL_119_136) (* 4 |v_mult_#in~n_2556|) (* 2 |v_mult_#in~n_2554|) aux_mod_v_mult_~n_BEFORE_CALL_119_136) 2147483646) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_119_136) (<= |v_mult_#in~n_2554| v_mult_~n_BEFORE_CALL_120) (forall ((|v_mult_#in~n_2310| Int) (|v_mult_#in~n_2313| Int)) (or (<= (+ |v_mult_#in~n_2310| |v_mult_#in~n_2313|) (div (+ (* |v_mult_#in~n_2554| 4) (* |v_mult_#in~n_2556| 8) (* v_mult_~n_BEFORE_CALL_120 2) (* aux_div_v_mult_~n_BEFORE_CALL_119_136 6) (* |v_mult_#in~n_2313| (- 2)) (- 2147483646) (* |v_mult_#in~n_2310| (- 4)) (* aux_mod_v_mult_~n_BEFORE_CALL_119_136 2)) 3)) (< |v_mult_#in~n_2313| |v_mult_#in~n_2310|) (< 2147483646 (+ v_mult_~n_BEFORE_CALL_120 (* 3 aux_div_v_mult_~n_BEFORE_CALL_119_136) (* 4 |v_mult_#in~n_2556|) (* 2 |v_mult_#in~n_2554|) |v_mult_#in~n_2313| aux_mod_v_mult_~n_BEFORE_CALL_119_136)))) (< aux_mod_v_mult_~n_BEFORE_CALL_119_136 3) (< aux_div_v_mult_~n_BEFORE_CALL_119_136 (+ v_mult_~n_BEFORE_CALL_120 |v_mult_#in~n_2554|)))) (exists ((|v_mult_#in~n_2310| Int) (|v_mult_#in~n_2313| Int)) (and (<= |v_mult_#in~n_2310| |v_mult_#in~n_2313|) (<= |v_mult_#in~n_2313| v_mult_~n_BEFORE_CALL_119) (< (div (+ (* |v_mult_#in~n_2313| (- 2)) (* v_mult_~n_BEFORE_CALL_119 (- 2)) 2147483646 (* |v_mult_#in~n_2310| (- 4))) 3) (+ |v_mult_#in~n_2310| |v_mult_#in~n_2313|)))) (< v_mult_~n_BEFORE_CALL_120 |c_mult_#in~n|) (<= (+ v_mult_~n_BEFORE_CALL_119 v_mult_~n_BEFORE_CALL_120 |c_mult_#res|) 2147483647) (< v_mult_~n_BEFORE_CALL_119 |v_mult_#in~n_BEFORE_CALL_88|))) is different from false [2021-11-12 23:38:40,647 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_mult_#in~n_BEFORE_CALL_88| Int) (v_mult_~n_BEFORE_CALL_119 Int) (v_mult_~n_BEFORE_CALL_120 Int)) (or (exists ((|v_mult_#in~n_2554| Int) (aux_div_v_mult_~n_BEFORE_CALL_119_136 Int) (aux_mod_v_mult_~n_BEFORE_CALL_119_136 Int) (|v_mult_#in~n_2556| Int)) (and (<= |v_mult_#in~n_2556| |v_mult_#in~n_2554|) (<= (+ v_mult_~n_BEFORE_CALL_120 |v_mult_#in~n_BEFORE_CALL_88| (* 3 aux_div_v_mult_~n_BEFORE_CALL_119_136) (* 4 |v_mult_#in~n_2556|) (* 2 |v_mult_#in~n_2554|) aux_mod_v_mult_~n_BEFORE_CALL_119_136) 2147483646) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_119_136) (<= |v_mult_#in~n_2554| v_mult_~n_BEFORE_CALL_120) (forall ((|v_mult_#in~n_2310| Int) (|v_mult_#in~n_2313| Int)) (or (<= (+ |v_mult_#in~n_2310| |v_mult_#in~n_2313|) (div (+ (* |v_mult_#in~n_2554| 4) (* |v_mult_#in~n_2556| 8) (* v_mult_~n_BEFORE_CALL_120 2) (* aux_div_v_mult_~n_BEFORE_CALL_119_136 6) (* |v_mult_#in~n_2313| (- 2)) (- 2147483646) (* |v_mult_#in~n_2310| (- 4)) (* aux_mod_v_mult_~n_BEFORE_CALL_119_136 2)) 3)) (< |v_mult_#in~n_2313| |v_mult_#in~n_2310|) (< 2147483646 (+ v_mult_~n_BEFORE_CALL_120 (* 3 aux_div_v_mult_~n_BEFORE_CALL_119_136) (* 4 |v_mult_#in~n_2556|) (* 2 |v_mult_#in~n_2554|) |v_mult_#in~n_2313| aux_mod_v_mult_~n_BEFORE_CALL_119_136)))) (< aux_mod_v_mult_~n_BEFORE_CALL_119_136 3) (< aux_div_v_mult_~n_BEFORE_CALL_119_136 (+ v_mult_~n_BEFORE_CALL_120 |v_mult_#in~n_2554|)))) (<= (+ v_mult_~n_BEFORE_CALL_119 v_mult_~n_BEFORE_CALL_120 |c_mult_#t~ret8| c_mult_~n) 2147483647) (exists ((|v_mult_#in~n_2310| Int) (|v_mult_#in~n_2313| Int)) (and (<= |v_mult_#in~n_2310| |v_mult_#in~n_2313|) (<= |v_mult_#in~n_2313| v_mult_~n_BEFORE_CALL_119) (< (div (+ (* |v_mult_#in~n_2313| (- 2)) (* v_mult_~n_BEFORE_CALL_119 (- 2)) 2147483646 (* |v_mult_#in~n_2310| (- 4))) 3) (+ |v_mult_#in~n_2310| |v_mult_#in~n_2313|)))) (< v_mult_~n_BEFORE_CALL_120 |c_mult_#in~n|) (< v_mult_~n_BEFORE_CALL_119 |v_mult_#in~n_BEFORE_CALL_88|))) is different from false [2021-11-12 23:39:07,297 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_mult_#in~n_2751| Int) (aux_mod_v_mult_~n_BEFORE_CALL_120_142 Int) (|v_mult_#in~n_BEFORE_CALL_88| Int) (v_mult_~n_BEFORE_CALL_119 Int) (aux_div_v_mult_~n_BEFORE_CALL_120_142 Int)) (let ((.cse2 (* 3 |v_mult_#in~n_2751|))) (or (exists ((|v_mult_#in~n_2554| Int) (aux_div_v_mult_~n_BEFORE_CALL_119_136 Int) (aux_mod_v_mult_~n_BEFORE_CALL_119_136 Int) (|v_mult_#in~n_2556| Int)) (let ((.cse0 (* 2 aux_div_v_mult_~n_BEFORE_CALL_120_142)) (.cse1 (* 3 |v_mult_#in~n_2751|))) (and (<= (+ v_mult_~n_BEFORE_CALL_119 .cse0 .cse1 c_mult_~n |v_mult_#in~n_2554| aux_mod_v_mult_~n_BEFORE_CALL_120_142) 2147483646) (<= |v_mult_#in~n_2556| |v_mult_#in~n_2554|) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_119_136) (< (+ v_mult_~n_BEFORE_CALL_119 .cse0 .cse1 aux_div_v_mult_~n_BEFORE_CALL_119_136 c_mult_~n aux_mod_v_mult_~n_BEFORE_CALL_120_142) (+ |v_mult_#in~n_2554| 2147483646)) (< aux_mod_v_mult_~n_BEFORE_CALL_119_136 3) (<= (+ |v_mult_#in~n_BEFORE_CALL_88| (* 3 aux_div_v_mult_~n_BEFORE_CALL_119_136) (* 4 |v_mult_#in~n_2556|) (* 2 |v_mult_#in~n_2554|) aux_mod_v_mult_~n_BEFORE_CALL_119_136) (+ v_mult_~n_BEFORE_CALL_119 .cse0 .cse1 c_mult_~n aux_mod_v_mult_~n_BEFORE_CALL_120_142)) (forall ((|v_mult_#in~n_2310| Int) (|v_mult_#in~n_2313| Int)) (or (<= (+ |v_mult_#in~n_2310| |v_mult_#in~n_2313|) (div (+ (* aux_mod_v_mult_~n_BEFORE_CALL_120_142 (- 2)) (* c_mult_~n (- 2)) (* |v_mult_#in~n_2554| 4) (* |v_mult_#in~n_2556| 8) (* aux_div_v_mult_~n_BEFORE_CALL_119_136 6) (* |v_mult_#in~n_2313| (- 2)) (* aux_div_v_mult_~n_BEFORE_CALL_120_142 (- 4)) (* |v_mult_#in~n_2751| (- 6)) (* v_mult_~n_BEFORE_CALL_119 (- 2)) 2147483646 (* |v_mult_#in~n_2310| (- 4)) (* aux_mod_v_mult_~n_BEFORE_CALL_119_136 2)) 3)) (< |v_mult_#in~n_2313| |v_mult_#in~n_2310|) (< (+ v_mult_~n_BEFORE_CALL_119 (* 2 aux_div_v_mult_~n_BEFORE_CALL_120_142) (* 3 |v_mult_#in~n_2751|) c_mult_~n aux_mod_v_mult_~n_BEFORE_CALL_120_142) (+ (* 3 aux_div_v_mult_~n_BEFORE_CALL_119_136) (* 4 |v_mult_#in~n_2556|) (* 2 |v_mult_#in~n_2554|) |v_mult_#in~n_2313| aux_mod_v_mult_~n_BEFORE_CALL_119_136))))))) (< 2147483646 (+ v_mult_~n_BEFORE_CALL_119 (* 2 aux_div_v_mult_~n_BEFORE_CALL_120_142) .cse2 |c_mult_#in~n| c_mult_~n aux_mod_v_mult_~n_BEFORE_CALL_120_142)) (exists ((|v_mult_#in~n_2310| Int) (|v_mult_#in~n_2313| Int)) (and (<= |v_mult_#in~n_2310| |v_mult_#in~n_2313|) (<= |v_mult_#in~n_2313| v_mult_~n_BEFORE_CALL_119) (< (div (+ (* |v_mult_#in~n_2313| (- 2)) (* v_mult_~n_BEFORE_CALL_119 (- 2)) 2147483646 (* |v_mult_#in~n_2310| (- 4))) 3) (+ |v_mult_#in~n_2310| |v_mult_#in~n_2313|)))) (< c_mult_~n |v_mult_#in~n_2751|) (<= (+ .cse2 c_mult_~n) aux_div_v_mult_~n_BEFORE_CALL_120_142) (< aux_mod_v_mult_~n_BEFORE_CALL_120_142 0) (<= 2 aux_mod_v_mult_~n_BEFORE_CALL_120_142) (< v_mult_~n_BEFORE_CALL_119 |v_mult_#in~n_BEFORE_CALL_88|)))) is different from false [2021-11-12 23:39:07,630 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [|v_mult_#in~n_BEFORE_CALL_88|, v_mult_~n_BEFORE_CALL_119] [2021-11-12 23:39:07,631 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [20557493] [2021-11-12 23:39:07,633 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2021-11-12 23:39:07,633 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:39:07,633 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-12 23:39:07,635 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-12 23:39:07,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2021-11-12 23:39:07,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479132109] [2021-11-12 23:39:07,635 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-12 23:39:07,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-11-12 23:39:07,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:39:07,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-11-12 23:39:07,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=2652, Unknown=16, NotChecked=318, Total=3192 [2021-11-12 23:39:07,638 INFO L87 Difference]: Start difference. First operand 224 states and 246 transitions. Second operand has 34 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 states have internal predecessors, (83), 4 states have call successors, (4), 2 states have call predecessors, (4), 15 states have return successors, (15), 15 states have call predecessors, (15), 3 states have call successors, (15) [2021-11-12 23:39:10,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:39:10,951 INFO L93 Difference]: Finished difference Result 233 states and 256 transitions. [2021-11-12 23:39:10,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-12 23:39:10,951 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 states have internal predecessors, (83), 4 states have call successors, (4), 2 states have call predecessors, (4), 15 states have return successors, (15), 15 states have call predecessors, (15), 3 states have call successors, (15) Word has length 186 [2021-11-12 23:39:10,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:39:10,953 INFO L225 Difference]: With dead ends: 233 [2021-11-12 23:39:10,953 INFO L226 Difference]: Without dead ends: 230 [2021-11-12 23:39:10,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 179 SyntacticMatches, 12 SemanticMatches, 84 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1118 ImplicationChecksByTransitivity, 60.1s TimeCoverageRelationStatistics Valid=535, Invalid=6267, Unknown=16, NotChecked=492, Total=7310 [2021-11-12 23:39:10,956 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 164 mSDsluCounter, 2087 mSDsCounter, 0 mSdLazyCounter, 1698 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1463.14ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 2093 SdHoareTripleChecker+Invalid, 1799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.33ms SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1612.05ms IncrementalHoareTripleChecker+Time [2021-11-12 23:39:10,957 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 2093 Invalid, 1799 Unknown, 0 Unchecked, 8.33ms Time], IncrementalHoareTripleChecker [101 Valid, 1698 Invalid, 0 Unknown, 0 Unchecked, 1612.05ms Time] [2021-11-12 23:39:10,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-11-12 23:39:10,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2021-11-12 23:39:10,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 184 states have (on average 1.0869565217391304) internal successors, (200), 184 states have internal predecessors, (200), 19 states have call successors, (19), 12 states have call predecessors, (19), 25 states have return successors, (32), 32 states have call predecessors, (32), 18 states have call successors, (32) [2021-11-12 23:39:10,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 251 transitions. [2021-11-12 23:39:10,968 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 251 transitions. Word has length 186 [2021-11-12 23:39:10,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:39:10,969 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 251 transitions. [2021-11-12 23:39:10,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 states have internal predecessors, (83), 4 states have call successors, (4), 2 states have call predecessors, (4), 15 states have return successors, (15), 15 states have call predecessors, (15), 3 states have call successors, (15) [2021-11-12 23:39:10,969 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 251 transitions. [2021-11-12 23:39:10,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2021-11-12 23:39:10,973 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:39:10,974 INFO L514 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 15, 15, 15, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:39:11,027 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-11-12 23:39:11,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-11-12 23:39:11,199 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-12 23:39:11,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:39:11,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1876783260, now seen corresponding path program 10 times [2021-11-12 23:39:11,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:39:11,200 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639306527] [2021-11-12 23:39:11,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:39:11,200 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:39:11,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:39:12,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1531 backedges. 0 proven. 859 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2021-11-12 23:39:12,751 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:39:12,752 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639306527] [2021-11-12 23:39:12,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639306527] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:39:12,752 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350464475] [2021-11-12 23:39:12,752 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-12 23:39:12,752 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:39:12,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:39:12,753 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:39:12,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-12 23:39:13,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:39:13,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 66 conjunts are in the unsatisfiable core [2021-11-12 23:39:13,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:39:16,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1531 backedges. 0 proven. 859 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2021-11-12 23:39:16,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:39:37,693 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_mult_#in~n_BEFORE_CALL_104| Int) (v_mult_~n_BEFORE_CALL_139 Int) (v_mult_~n_BEFORE_CALL_140 Int)) (or (< v_mult_~n_BEFORE_CALL_139 |v_mult_#in~n_BEFORE_CALL_104|) (<= (+ v_mult_~n_BEFORE_CALL_139 v_mult_~n_BEFORE_CALL_140 |c_mult_#res|) 2147483647) (exists ((|v_mult_#in~n_3069| Int)) (and (<= |v_mult_#in~n_3069| v_mult_~n_BEFORE_CALL_139) (< (div (+ (* |v_mult_#in~n_3069| (- 5)) (* v_mult_~n_BEFORE_CALL_139 (- 1)) 2147483646) 3) (+ v_mult_~n_BEFORE_CALL_139 (* 2 |v_mult_#in~n_3069|))))) (< v_mult_~n_BEFORE_CALL_140 |c_mult_#in~n|) (exists ((aux_div_v_mult_~n_BEFORE_CALL_139_88 Int) (|v_mult_#in~n_3340| Int) (aux_mod_v_mult_~n_BEFORE_CALL_139_88 Int)) (and (< aux_mod_v_mult_~n_BEFORE_CALL_139_88 3) (<= (+ aux_mod_v_mult_~n_BEFORE_CALL_139_88 (* 3 aux_div_v_mult_~n_BEFORE_CALL_139_88) |v_mult_#in~n_BEFORE_CALL_104| (* 2 |v_mult_#in~n_3340|)) 2147483646) (forall ((|v_mult_#in~n_3069| Int)) (let ((.cse0 (* 3 aux_div_v_mult_~n_BEFORE_CALL_139_88)) (.cse1 (* 2 |v_mult_#in~n_3340|))) (or (< 2147483646 (+ aux_mod_v_mult_~n_BEFORE_CALL_139_88 .cse0 .cse1 |v_mult_#in~n_3069|)) (<= (+ (* 2 |v_mult_#in~n_3069|) 2147483646) (+ aux_mod_v_mult_~n_BEFORE_CALL_139_88 .cse0 .cse1 (div (+ (* |v_mult_#in~n_3340| 2) aux_mod_v_mult_~n_BEFORE_CALL_139_88 (* |v_mult_#in~n_3069| (- 5)) (* aux_div_v_mult_~n_BEFORE_CALL_139_88 3)) 3)))))) (< aux_div_v_mult_~n_BEFORE_CALL_139_88 (* 4 v_mult_~n_BEFORE_CALL_140)) (<= |v_mult_#in~n_3340| v_mult_~n_BEFORE_CALL_140) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_139_88))))) is different from false [2021-11-12 23:39:41,662 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_mult_#in~n_BEFORE_CALL_104| Int) (v_mult_~n_BEFORE_CALL_139 Int) (v_mult_~n_BEFORE_CALL_140 Int)) (or (< v_mult_~n_BEFORE_CALL_139 |v_mult_#in~n_BEFORE_CALL_104|) (<= (+ v_mult_~n_BEFORE_CALL_139 v_mult_~n_BEFORE_CALL_140 |c_mult_#t~ret8| c_mult_~n) 2147483647) (exists ((|v_mult_#in~n_3069| Int)) (and (<= |v_mult_#in~n_3069| v_mult_~n_BEFORE_CALL_139) (< (div (+ (* |v_mult_#in~n_3069| (- 5)) (* v_mult_~n_BEFORE_CALL_139 (- 1)) 2147483646) 3) (+ v_mult_~n_BEFORE_CALL_139 (* 2 |v_mult_#in~n_3069|))))) (< v_mult_~n_BEFORE_CALL_140 |c_mult_#in~n|) (exists ((aux_div_v_mult_~n_BEFORE_CALL_139_88 Int) (|v_mult_#in~n_3340| Int) (aux_mod_v_mult_~n_BEFORE_CALL_139_88 Int)) (and (< aux_mod_v_mult_~n_BEFORE_CALL_139_88 3) (<= (+ aux_mod_v_mult_~n_BEFORE_CALL_139_88 (* 3 aux_div_v_mult_~n_BEFORE_CALL_139_88) |v_mult_#in~n_BEFORE_CALL_104| (* 2 |v_mult_#in~n_3340|)) 2147483646) (forall ((|v_mult_#in~n_3069| Int)) (let ((.cse0 (* 3 aux_div_v_mult_~n_BEFORE_CALL_139_88)) (.cse1 (* 2 |v_mult_#in~n_3340|))) (or (< 2147483646 (+ aux_mod_v_mult_~n_BEFORE_CALL_139_88 .cse0 .cse1 |v_mult_#in~n_3069|)) (<= (+ (* 2 |v_mult_#in~n_3069|) 2147483646) (+ aux_mod_v_mult_~n_BEFORE_CALL_139_88 .cse0 .cse1 (div (+ (* |v_mult_#in~n_3340| 2) aux_mod_v_mult_~n_BEFORE_CALL_139_88 (* |v_mult_#in~n_3069| (- 5)) (* aux_div_v_mult_~n_BEFORE_CALL_139_88 3)) 3)))))) (< aux_div_v_mult_~n_BEFORE_CALL_139_88 (* 4 v_mult_~n_BEFORE_CALL_140)) (<= |v_mult_#in~n_3340| v_mult_~n_BEFORE_CALL_140) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_139_88))))) is different from false [2021-11-12 23:39:54,001 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_mult_#in~n_BEFORE_CALL_104| Int) (aux_mod_v_mult_~n_BEFORE_CALL_139_202 Int) (|v_mult_#in~n_3584| Int) (|v_mult_#in~n_3582| Int) (|v_mult_#in~n_3580| Int) (v_mult_~n_BEFORE_CALL_140 Int) (aux_div_v_mult_~n_BEFORE_CALL_139_202 Int)) (or (< |v_mult_#in~n_3584| |v_mult_#in~n_3582|) (< c_mult_~n |v_mult_#in~n_3584|) (< |v_mult_#in~n_3582| |v_mult_#in~n_3580|) (exists ((|v_mult_#in~n_3069| Int)) (let ((.cse0 (* 3 aux_div_v_mult_~n_BEFORE_CALL_139_202)) (.cse1 (* 2 c_mult_~n)) (.cse2 (* 2 |v_mult_#in~n_3580|)) (.cse3 (* 4 |v_mult_#in~n_3582|)) (.cse4 (* 2 |v_mult_#in~n_3584|))) (and (<= (+ v_mult_~n_BEFORE_CALL_140 .cse0 .cse1 .cse2 .cse3 |v_mult_#in~n_3069| .cse4 aux_mod_v_mult_~n_BEFORE_CALL_139_202) 2147483646) (< (+ v_mult_~n_BEFORE_CALL_140 .cse0 .cse1 .cse2 .cse3 (div (+ v_mult_~n_BEFORE_CALL_140 (* |v_mult_#in~n_3069| (- 5)) (* |v_mult_#in~n_3582| 4) (* |v_mult_#in~n_3584| 2) (* aux_div_v_mult_~n_BEFORE_CALL_139_202 3) (* c_mult_~n 2) (* |v_mult_#in~n_3580| 2) aux_mod_v_mult_~n_BEFORE_CALL_139_202) 3) .cse4 aux_mod_v_mult_~n_BEFORE_CALL_139_202) (+ (* 2 |v_mult_#in~n_3069|) 2147483646))))) (< aux_mod_v_mult_~n_BEFORE_CALL_139_202 0) (<= |v_mult_#in~n_3584| aux_div_v_mult_~n_BEFORE_CALL_139_202) (< 2147483646 (+ v_mult_~n_BEFORE_CALL_140 |v_mult_#in~n_BEFORE_CALL_104| (* 3 aux_div_v_mult_~n_BEFORE_CALL_139_202) (* 2 c_mult_~n) (* 2 |v_mult_#in~n_3580|) (* 4 |v_mult_#in~n_3582|) (* 2 |v_mult_#in~n_3584|) aux_mod_v_mult_~n_BEFORE_CALL_139_202)) (< v_mult_~n_BEFORE_CALL_140 |c_mult_#in~n|) (<= 3 aux_mod_v_mult_~n_BEFORE_CALL_139_202) (exists ((aux_div_v_mult_~n_BEFORE_CALL_139_88 Int) (|v_mult_#in~n_3340| Int) (aux_mod_v_mult_~n_BEFORE_CALL_139_88 Int)) (and (< aux_mod_v_mult_~n_BEFORE_CALL_139_88 3) (<= (+ aux_mod_v_mult_~n_BEFORE_CALL_139_88 (* 3 aux_div_v_mult_~n_BEFORE_CALL_139_88) |v_mult_#in~n_BEFORE_CALL_104| (* 2 |v_mult_#in~n_3340|)) 2147483646) (forall ((|v_mult_#in~n_3069| Int)) (let ((.cse5 (* 3 aux_div_v_mult_~n_BEFORE_CALL_139_88)) (.cse6 (* 2 |v_mult_#in~n_3340|))) (or (< 2147483646 (+ aux_mod_v_mult_~n_BEFORE_CALL_139_88 .cse5 .cse6 |v_mult_#in~n_3069|)) (<= (+ (* 2 |v_mult_#in~n_3069|) 2147483646) (+ aux_mod_v_mult_~n_BEFORE_CALL_139_88 .cse5 .cse6 (div (+ (* |v_mult_#in~n_3340| 2) aux_mod_v_mult_~n_BEFORE_CALL_139_88 (* |v_mult_#in~n_3069| (- 5)) (* aux_div_v_mult_~n_BEFORE_CALL_139_88 3)) 3)))))) (< aux_div_v_mult_~n_BEFORE_CALL_139_88 (* 4 v_mult_~n_BEFORE_CALL_140)) (<= |v_mult_#in~n_3340| v_mult_~n_BEFORE_CALL_140) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_139_88))))) is different from false [2021-11-12 23:39:54,023 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [|v_mult_#in~n_BEFORE_CALL_104|, v_mult_~n_BEFORE_CALL_140] [2021-11-12 23:39:54,024 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1122253198] [2021-11-12 23:39:54,025 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2021-11-12 23:39:54,025 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:39:54,025 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-12 23:39:54,026 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-12 23:39:54,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2021-11-12 23:39:54,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912339267] [2021-11-12 23:39:54,026 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-12 23:39:54,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-11-12 23:39:54,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:39:54,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-11-12 23:39:54,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2983, Unknown=4, NotChecked=336, Total=3540 [2021-11-12 23:39:54,028 INFO L87 Difference]: Start difference. First operand 229 states and 251 transitions. Second operand has 36 states, 35 states have (on average 2.4857142857142858) internal successors, (87), 35 states have internal predecessors, (87), 4 states have call successors, (5), 2 states have call predecessors, (5), 16 states have return successors, (16), 16 states have call predecessors, (16), 3 states have call successors, (16) [2021-11-12 23:39:57,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:39:57,544 INFO L93 Difference]: Finished difference Result 238 states and 261 transitions. [2021-11-12 23:39:57,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-12 23:39:57,545 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.4857142857142858) internal successors, (87), 35 states have internal predecessors, (87), 4 states have call successors, (5), 2 states have call predecessors, (5), 16 states have return successors, (16), 16 states have call predecessors, (16), 3 states have call successors, (16) Word has length 212 [2021-11-12 23:39:57,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:39:57,547 INFO L225 Difference]: With dead ends: 238 [2021-11-12 23:39:57,547 INFO L226 Difference]: Without dead ends: 235 [2021-11-12 23:39:57,549 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 208 SyntacticMatches, 13 SemanticMatches, 89 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1262 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=569, Invalid=7095, Unknown=4, NotChecked=522, Total=8190 [2021-11-12 23:39:57,549 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 174 mSDsluCounter, 2252 mSDsCounter, 0 mSdLazyCounter, 1938 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1527.77ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 2255 SdHoareTripleChecker+Invalid, 2045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.01ms SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1694.76ms IncrementalHoareTripleChecker+Time [2021-11-12 23:39:57,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 2255 Invalid, 2045 Unknown, 0 Unchecked, 8.01ms Time], IncrementalHoareTripleChecker [107 Valid, 1938 Invalid, 0 Unknown, 0 Unchecked, 1694.76ms Time] [2021-11-12 23:39:57,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2021-11-12 23:39:57,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 234. [2021-11-12 23:39:57,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 188 states have (on average 1.0851063829787233) internal successors, (204), 188 states have internal predecessors, (204), 19 states have call successors, (19), 12 states have call predecessors, (19), 26 states have return successors, (33), 33 states have call predecessors, (33), 18 states have call successors, (33) [2021-11-12 23:39:57,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 256 transitions. [2021-11-12 23:39:57,562 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 256 transitions. Word has length 212 [2021-11-12 23:39:57,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:39:57,563 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 256 transitions. [2021-11-12 23:39:57,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.4857142857142858) internal successors, (87), 35 states have internal predecessors, (87), 4 states have call successors, (5), 2 states have call predecessors, (5), 16 states have return successors, (16), 16 states have call predecessors, (16), 3 states have call successors, (16) [2021-11-12 23:39:57,563 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 256 transitions. [2021-11-12 23:39:57,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2021-11-12 23:39:57,568 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:39:57,568 INFO L514 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 16, 16, 16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:39:57,619 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-11-12 23:39:57,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:39:57,795 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-12 23:39:57,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:39:57,796 INFO L85 PathProgramCache]: Analyzing trace with hash -169497624, now seen corresponding path program 11 times [2021-11-12 23:39:57,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:39:57,796 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029799255] [2021-11-12 23:39:57,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:39:57,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:39:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:39:59,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1728 backedges. 0 proven. 957 refuted. 0 times theorem prover too weak. 771 trivial. 0 not checked. [2021-11-12 23:39:59,612 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:39:59,613 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029799255] [2021-11-12 23:39:59,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029799255] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:39:59,613 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772205005] [2021-11-12 23:39:59,613 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-12 23:39:59,613 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:39:59,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:39:59,614 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:39:59,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-12 23:40:00,383 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2021-11-12 23:40:00,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-12 23:40:00,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 70 conjunts are in the unsatisfiable core [2021-11-12 23:40:00,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:40:04,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1728 backedges. 0 proven. 957 refuted. 0 times theorem prover too weak. 771 trivial. 0 not checked. [2021-11-12 23:40:04,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:40:26,068 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_160] [2021-11-12 23:40:26,068 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1398635999] [2021-11-12 23:40:26,070 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2021-11-12 23:40:26,070 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:40:26,071 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-12 23:40:26,072 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-12 23:40:26,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2021-11-12 23:40:26,072 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472413291] [2021-11-12 23:40:26,072 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-12 23:40:26,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-11-12 23:40:26,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:40:26,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-11-12 23:40:26,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=3316, Unknown=0, NotChecked=0, Total=3540 [2021-11-12 23:40:26,074 INFO L87 Difference]: Start difference. First operand 234 states and 256 transitions. Second operand has 38 states, 37 states have (on average 2.4594594594594597) internal successors, (91), 37 states have internal predecessors, (91), 4 states have call successors, (5), 2 states have call predecessors, (5), 17 states have return successors, (17), 17 states have call predecessors, (17), 3 states have call successors, (17) [2021-11-12 23:40:30,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:40:30,398 INFO L93 Difference]: Finished difference Result 243 states and 266 transitions. [2021-11-12 23:40:30,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-12 23:40:30,398 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.4594594594594597) internal successors, (91), 37 states have internal predecessors, (91), 4 states have call successors, (5), 2 states have call predecessors, (5), 17 states have return successors, (17), 17 states have call predecessors, (17), 3 states have call successors, (17) Word has length 224 [2021-11-12 23:40:30,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:40:30,401 INFO L225 Difference]: With dead ends: 243 [2021-11-12 23:40:30,401 INFO L226 Difference]: Without dead ends: 240 [2021-11-12 23:40:30,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 216 SyntacticMatches, 14 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1425 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=599, Invalid=7957, Unknown=0, NotChecked=0, Total=8556 [2021-11-12 23:40:30,403 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 184 mSDsluCounter, 2373 mSDsCounter, 0 mSdLazyCounter, 2190 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1933.34ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 2375 SdHoareTripleChecker+Invalid, 2304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.91ms SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 2190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2132.91ms IncrementalHoareTripleChecker+Time [2021-11-12 23:40:30,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 2375 Invalid, 2304 Unknown, 0 Unchecked, 9.91ms Time], IncrementalHoareTripleChecker [114 Valid, 2190 Invalid, 0 Unknown, 0 Unchecked, 2132.91ms Time] [2021-11-12 23:40:30,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-11-12 23:40:30,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 239. [2021-11-12 23:40:30,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 192 states have (on average 1.0833333333333333) internal successors, (208), 192 states have internal predecessors, (208), 19 states have call successors, (19), 12 states have call predecessors, (19), 27 states have return successors, (34), 34 states have call predecessors, (34), 18 states have call successors, (34) [2021-11-12 23:40:30,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 261 transitions. [2021-11-12 23:40:30,418 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 261 transitions. Word has length 224 [2021-11-12 23:40:30,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:40:30,418 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 261 transitions. [2021-11-12 23:40:30,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.4594594594594597) internal successors, (91), 37 states have internal predecessors, (91), 4 states have call successors, (5), 2 states have call predecessors, (5), 17 states have return successors, (17), 17 states have call predecessors, (17), 3 states have call successors, (17) [2021-11-12 23:40:30,419 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 261 transitions. [2021-11-12 23:40:30,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2021-11-12 23:40:30,422 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:40:30,422 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 17, 17, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:40:30,472 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-11-12 23:40:30,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:40:30,636 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-12 23:40:30,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:40:30,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1189783524, now seen corresponding path program 12 times [2021-11-12 23:40:30,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:40:30,636 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315494653] [2021-11-12 23:40:30,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:40:30,636 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:40:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:40:32,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1937 backedges. 0 proven. 1060 refuted. 0 times theorem prover too weak. 877 trivial. 0 not checked. [2021-11-12 23:40:32,584 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:40:32,585 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315494653] [2021-11-12 23:40:32,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315494653] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:40:32,585 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253689899] [2021-11-12 23:40:32,585 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-12 23:40:32,585 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:40:32,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:40:32,586 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:40:32,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-11-12 23:40:33,466 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-12 23:40:33,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-12 23:40:33,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 74 conjunts are in the unsatisfiable core [2021-11-12 23:40:33,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:40:37,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1937 backedges. 0 proven. 1060 refuted. 0 times theorem prover too weak. 877 trivial. 0 not checked. [2021-11-12 23:40:37,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:40:53,437 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_181 Int)) (or (<= (+ v_mult_~n_BEFORE_CALL_181 |c_mult_#res|) 2147483647) (< v_mult_~n_BEFORE_CALL_181 |c_mult_#in~n|) (exists ((|v_mult_#in~n_4671| Int) (|aux_div_v_mult_#in~n_4672_142| Int) (|v_mult_#in~n_4668| Int)) (let ((.cse1 (* 2 |aux_div_v_mult_#in~n_4672_142|)) (.cse0 (div (+ (* v_mult_~n_BEFORE_CALL_181 (- 2)) (* |v_mult_#in~n_4671| (- 4)) (* |v_mult_#in~n_4668| (- 2)) 2147483646) 3))) (and (< .cse0 (+ 2 .cse1 |v_mult_#in~n_4671|)) (< |aux_div_v_mult_#in~n_4672_142| |v_mult_#in~n_4668|) (<= (+ .cse1 |v_mult_#in~n_4668|) .cse0) (<= |v_mult_#in~n_4671| v_mult_~n_BEFORE_CALL_181) (<= |v_mult_#in~n_4668| |v_mult_#in~n_4671|)))))) is different from false [2021-11-12 23:40:55,880 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_181 Int)) (or (<= (+ v_mult_~n_BEFORE_CALL_181 |c_mult_#t~ret8| c_mult_~n) 2147483647) (< v_mult_~n_BEFORE_CALL_181 |c_mult_#in~n|) (exists ((|v_mult_#in~n_4671| Int) (|aux_div_v_mult_#in~n_4672_142| Int) (|v_mult_#in~n_4668| Int)) (let ((.cse1 (* 2 |aux_div_v_mult_#in~n_4672_142|)) (.cse0 (div (+ (* v_mult_~n_BEFORE_CALL_181 (- 2)) (* |v_mult_#in~n_4671| (- 4)) (* |v_mult_#in~n_4668| (- 2)) 2147483646) 3))) (and (< .cse0 (+ 2 .cse1 |v_mult_#in~n_4671|)) (< |aux_div_v_mult_#in~n_4672_142| |v_mult_#in~n_4668|) (<= (+ .cse1 |v_mult_#in~n_4668|) .cse0) (<= |v_mult_#in~n_4671| v_mult_~n_BEFORE_CALL_181) (<= |v_mult_#in~n_4668| |v_mult_#in~n_4671|)))))) is different from false [2021-11-12 23:41:09,025 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_mult_#in~n_5026| Int) (|v_mult_#in~n_5033| Int) (|v_mult_#in~n_5024| Int) (|v_mult_#in~n_5025| Int) (v_mult_~n_BEFORE_CALL_181 Int)) (or (< |v_mult_#in~n_5033| |v_mult_#in~n_5025|) (< |v_mult_#in~n_5026| |v_mult_#in~n_5024|) (< v_mult_~n_BEFORE_CALL_181 |c_mult_#in~n|) (exists ((|v_mult_#in~n_4671| Int) (|aux_div_v_mult_#in~n_4672_142| Int) (|v_mult_#in~n_4668| Int)) (let ((.cse1 (* 2 |aux_div_v_mult_#in~n_4672_142|)) (.cse0 (div (+ (* v_mult_~n_BEFORE_CALL_181 (- 2)) (* |v_mult_#in~n_4671| (- 4)) (* |v_mult_#in~n_4668| (- 2)) 2147483646) 3))) (and (< .cse0 (+ 2 .cse1 |v_mult_#in~n_4671|)) (< |aux_div_v_mult_#in~n_4672_142| |v_mult_#in~n_4668|) (<= (+ .cse1 |v_mult_#in~n_4668|) .cse0) (<= |v_mult_#in~n_4671| v_mult_~n_BEFORE_CALL_181) (<= |v_mult_#in~n_4668| |v_mult_#in~n_4671|)))) (<= (+ v_mult_~n_BEFORE_CALL_181 (* 2 |v_mult_#in~n_5024|) (* 2 |v_mult_#in~n_5026|) (* 5 |v_mult_#in~n_5033|) (* 2 |v_mult_#in~n_5025|) (* 5 c_mult_~n)) 2147483646) (< c_mult_~n |v_mult_#in~n_5026|) (< |v_mult_#in~n_5024| |v_mult_#in~n_5033|))) is different from false [2021-11-12 23:41:09,048 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_181] [2021-11-12 23:41:09,049 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [202862220] [2021-11-12 23:41:09,050 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2021-11-12 23:41:09,050 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:41:09,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:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-12 23:41:09,051 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-12 23:41:09,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2021-11-12 23:41:09,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315715794] [2021-11-12 23:41:09,051 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-12 23:41:09,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-12 23:41:09,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:41:09,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-12 23:41:09,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=3386, Unknown=3, NotChecked=354, Total=3906 [2021-11-12 23:41:09,054 INFO L87 Difference]: Start difference. First operand 239 states and 261 transitions. Second operand has 40 states, 39 states have (on average 2.4358974358974357) internal successors, (95), 39 states have internal predecessors, (95), 4 states have call successors, (5), 2 states have call predecessors, (5), 18 states have return successors, (18), 18 states have call predecessors, (18), 3 states have call successors, (18) [2021-11-12 23:41:13,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:41:13,975 INFO L93 Difference]: Finished difference Result 248 states and 271 transitions. [2021-11-12 23:41:13,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-11-12 23:41:13,975 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.4358974358974357) internal successors, (95), 39 states have internal predecessors, (95), 4 states have call successors, (5), 2 states have call predecessors, (5), 18 states have return successors, (18), 18 states have call predecessors, (18), 3 states have call successors, (18) Word has length 236 [2021-11-12 23:41:13,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:41:13,978 INFO L225 Difference]: With dead ends: 248 [2021-11-12 23:41:13,978 INFO L226 Difference]: Without dead ends: 245 [2021-11-12 23:41:13,980 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 227 SyntacticMatches, 15 SemanticMatches, 96 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1500 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=492, Invalid=8447, Unknown=3, NotChecked=564, Total=9506 [2021-11-12 23:41:13,981 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 194 mSDsluCounter, 2594 mSDsCounter, 0 mSdLazyCounter, 2466 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2312.22ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 2591 SdHoareTripleChecker+Invalid, 2587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.19ms SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 2466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2545.15ms IncrementalHoareTripleChecker+Time [2021-11-12 23:41:13,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 2591 Invalid, 2587 Unknown, 0 Unchecked, 12.19ms Time], IncrementalHoareTripleChecker [121 Valid, 2466 Invalid, 0 Unknown, 0 Unchecked, 2545.15ms Time] [2021-11-12 23:41:13,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-11-12 23:41:13,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 244. [2021-11-12 23:41:13,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 196 states have (on average 1.0816326530612246) internal successors, (212), 196 states have internal predecessors, (212), 19 states have call successors, (19), 12 states have call predecessors, (19), 28 states have return successors, (35), 35 states have call predecessors, (35), 18 states have call successors, (35) [2021-11-12 23:41:13,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 266 transitions. [2021-11-12 23:41:13,995 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 266 transitions. Word has length 236 [2021-11-12 23:41:13,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:41:13,997 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 266 transitions. [2021-11-12 23:41:13,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.4358974358974357) internal successors, (95), 39 states have internal predecessors, (95), 4 states have call successors, (5), 2 states have call predecessors, (5), 18 states have return successors, (18), 18 states have call predecessors, (18), 3 states have call successors, (18) [2021-11-12 23:41:13,997 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 266 transitions. [2021-11-12 23:41:14,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2021-11-12 23:41:14,000 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:41:14,000 INFO L514 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 18, 18, 18, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:41:14,035 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-11-12 23:41:14,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:41:14,208 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-12 23:41:14,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:41:14,208 INFO L85 PathProgramCache]: Analyzing trace with hash 533980264, now seen corresponding path program 13 times [2021-11-12 23:41:14,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:41:14,208 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100888035] [2021-11-12 23:41:14,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:41:14,209 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:41:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:41:16,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2158 backedges. 0 proven. 1168 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-11-12 23:41:16,721 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:41:16,721 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100888035] [2021-11-12 23:41:16,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100888035] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:41:16,721 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646226950] [2021-11-12 23:41:16,721 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-12 23:41:16,721 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:41:16,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:41:16,722 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:41:16,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-11-12 23:41:17,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:41:17,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 78 conjunts are in the unsatisfiable core [2021-11-12 23:41:17,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:41:22,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2158 backedges. 0 proven. 1168 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-11-12 23:41:22,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:41:59,485 WARN L838 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_mult_~n_BEFORE_CALL_203_88 Int) (|v_mult_#in~n_5907| Int) (|v_mult_#in~n_5899| Int) (aux_div_v_mult_~n_BEFORE_CALL_203_88 Int)) (or (< c_mult_~n |v_mult_#in~n_5907|) (exists ((|v_mult_#in~n_5489| Int) (|v_mult_#in~n_5491| Int) (|v_mult_#in~n_5482| Int)) (and (< (div (+ (* |v_mult_#in~n_5489| (- 3)) (- 8589934584) (* aux_div_v_mult_~n_BEFORE_CALL_203_88 10) (* |v_mult_#in~n_5482| (- 3)) (* |v_mult_#in~n_5899| 15) (* aux_mod_v_mult_~n_BEFORE_CALL_203_88 5) (* |v_mult_#in~n_5491| (- 3))) 2) (* 2 |v_mult_#in~n_5482|)) (<= |v_mult_#in~n_5482| |v_mult_#in~n_5489|) (<= (+ aux_mod_v_mult_~n_BEFORE_CALL_203_88 (* 3 |v_mult_#in~n_5899|) (* 2 aux_div_v_mult_~n_BEFORE_CALL_203_88) |v_mult_#in~n_5489|) 2147483646) (<= |v_mult_#in~n_5491| |v_mult_#in~n_5482|))) (<= 2 aux_mod_v_mult_~n_BEFORE_CALL_203_88) (< 2147483646 (+ aux_mod_v_mult_~n_BEFORE_CALL_203_88 (* 3 |v_mult_#in~n_5899|) (* 2 aux_div_v_mult_~n_BEFORE_CALL_203_88) |c_mult_#in~n|)) (<= (+ (* 2 |v_mult_#in~n_5907|) (* 5 c_mult_~n)) aux_div_v_mult_~n_BEFORE_CALL_203_88) (< |v_mult_#in~n_5907| |v_mult_#in~n_5899|) (< aux_mod_v_mult_~n_BEFORE_CALL_203_88 0))) is different from false [2021-11-12 23:42:06,434 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_mult_#in~n_BEFORE_CALL_156| Int) (v_mult_~n_BEFORE_CALL_203 Int) (v_mult_~n_BEFORE_CALL_204 Int)) (or (< v_mult_~n_BEFORE_CALL_203 |v_mult_#in~n_BEFORE_CALL_156|) (exists ((|v_mult_#in~n_5489| Int) (|v_mult_#in~n_5491| Int) (|v_mult_#in~n_5482| Int)) (and (<= |v_mult_#in~n_5489| v_mult_~n_BEFORE_CALL_203) (<= |v_mult_#in~n_5482| |v_mult_#in~n_5489|) (< (div (+ (* |v_mult_#in~n_5489| (- 3)) (* |v_mult_#in~n_5482| (- 3)) (* v_mult_~n_BEFORE_CALL_203 (- 5)) (* |v_mult_#in~n_5491| (- 3)) 2147483646) 2) (* 2 |v_mult_#in~n_5482|)) (<= |v_mult_#in~n_5491| |v_mult_#in~n_5482|))) (exists ((aux_mod_v_mult_~n_BEFORE_CALL_203_88 Int) (|v_mult_#in~n_5907| Int) (|v_mult_#in~n_5899| Int) (aux_div_v_mult_~n_BEFORE_CALL_203_88 Int)) (and (<= |v_mult_#in~n_5907| v_mult_~n_BEFORE_CALL_204) (<= (+ aux_mod_v_mult_~n_BEFORE_CALL_203_88 (* 3 |v_mult_#in~n_5899|) (* 2 aux_div_v_mult_~n_BEFORE_CALL_203_88) |v_mult_#in~n_BEFORE_CALL_156|) 2147483646) (forall ((|v_mult_#in~n_5489| Int) (|v_mult_#in~n_5491| Int) (|v_mult_#in~n_5482| Int)) (or (< |v_mult_#in~n_5482| |v_mult_#in~n_5491|) (<= (* 2 |v_mult_#in~n_5482|) (div (+ (* |v_mult_#in~n_5489| (- 3)) (- 8589934584) (* aux_div_v_mult_~n_BEFORE_CALL_203_88 10) (* |v_mult_#in~n_5482| (- 3)) (* |v_mult_#in~n_5899| 15) (* aux_mod_v_mult_~n_BEFORE_CALL_203_88 5) (* |v_mult_#in~n_5491| (- 3))) 2)) (< 2147483646 (+ aux_mod_v_mult_~n_BEFORE_CALL_203_88 (* 3 |v_mult_#in~n_5899|) (* 2 aux_div_v_mult_~n_BEFORE_CALL_203_88) |v_mult_#in~n_5489|)) (< |v_mult_#in~n_5489| |v_mult_#in~n_5482|))) (< aux_mod_v_mult_~n_BEFORE_CALL_203_88 2) (< aux_div_v_mult_~n_BEFORE_CALL_203_88 (+ (* 2 |v_mult_#in~n_5907|) (* 5 v_mult_~n_BEFORE_CALL_204))) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_203_88) (<= |v_mult_#in~n_5899| |v_mult_#in~n_5907|))) (<= (+ v_mult_~n_BEFORE_CALL_204 v_mult_~n_BEFORE_CALL_203 |c_mult_#res|) 2147483647) (< v_mult_~n_BEFORE_CALL_204 |c_mult_#in~n|))) is different from false [2021-11-12 23:42:18,471 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_mult_#in~n_BEFORE_CALL_156| Int) (v_mult_~n_BEFORE_CALL_203 Int) (v_mult_~n_BEFORE_CALL_204 Int)) (or (< v_mult_~n_BEFORE_CALL_203 |v_mult_#in~n_BEFORE_CALL_156|) (exists ((|v_mult_#in~n_5489| Int) (|v_mult_#in~n_5491| Int) (|v_mult_#in~n_5482| Int)) (and (<= |v_mult_#in~n_5489| v_mult_~n_BEFORE_CALL_203) (<= |v_mult_#in~n_5482| |v_mult_#in~n_5489|) (< (div (+ (* |v_mult_#in~n_5489| (- 3)) (* |v_mult_#in~n_5482| (- 3)) (* v_mult_~n_BEFORE_CALL_203 (- 5)) (* |v_mult_#in~n_5491| (- 3)) 2147483646) 2) (* 2 |v_mult_#in~n_5482|)) (<= |v_mult_#in~n_5491| |v_mult_#in~n_5482|))) (exists ((aux_mod_v_mult_~n_BEFORE_CALL_203_88 Int) (|v_mult_#in~n_5907| Int) (|v_mult_#in~n_5899| Int) (aux_div_v_mult_~n_BEFORE_CALL_203_88 Int)) (and (<= |v_mult_#in~n_5907| v_mult_~n_BEFORE_CALL_204) (<= (+ aux_mod_v_mult_~n_BEFORE_CALL_203_88 (* 3 |v_mult_#in~n_5899|) (* 2 aux_div_v_mult_~n_BEFORE_CALL_203_88) |v_mult_#in~n_BEFORE_CALL_156|) 2147483646) (forall ((|v_mult_#in~n_5489| Int) (|v_mult_#in~n_5491| Int) (|v_mult_#in~n_5482| Int)) (or (< |v_mult_#in~n_5482| |v_mult_#in~n_5491|) (<= (* 2 |v_mult_#in~n_5482|) (div (+ (* |v_mult_#in~n_5489| (- 3)) (- 8589934584) (* aux_div_v_mult_~n_BEFORE_CALL_203_88 10) (* |v_mult_#in~n_5482| (- 3)) (* |v_mult_#in~n_5899| 15) (* aux_mod_v_mult_~n_BEFORE_CALL_203_88 5) (* |v_mult_#in~n_5491| (- 3))) 2)) (< 2147483646 (+ aux_mod_v_mult_~n_BEFORE_CALL_203_88 (* 3 |v_mult_#in~n_5899|) (* 2 aux_div_v_mult_~n_BEFORE_CALL_203_88) |v_mult_#in~n_5489|)) (< |v_mult_#in~n_5489| |v_mult_#in~n_5482|))) (< aux_mod_v_mult_~n_BEFORE_CALL_203_88 2) (< aux_div_v_mult_~n_BEFORE_CALL_203_88 (+ (* 2 |v_mult_#in~n_5907|) (* 5 v_mult_~n_BEFORE_CALL_204))) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_203_88) (<= |v_mult_#in~n_5899| |v_mult_#in~n_5907|))) (< v_mult_~n_BEFORE_CALL_204 |c_mult_#in~n|) (<= (+ v_mult_~n_BEFORE_CALL_204 v_mult_~n_BEFORE_CALL_203 |c_mult_#t~ret8| c_mult_~n) 2147483647))) is different from false [2021-11-12 23:42:20,477 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_mult_#in~n_BEFORE_CALL_156| Int) (v_mult_~n_BEFORE_CALL_203 Int) (v_mult_~n_BEFORE_CALL_204 Int)) (or (< v_mult_~n_BEFORE_CALL_203 |v_mult_#in~n_BEFORE_CALL_156|) (exists ((|v_mult_#in~n_5489| Int) (|v_mult_#in~n_5491| Int) (|v_mult_#in~n_5482| Int)) (and (<= |v_mult_#in~n_5489| v_mult_~n_BEFORE_CALL_203) (<= |v_mult_#in~n_5482| |v_mult_#in~n_5489|) (< (div (+ (* |v_mult_#in~n_5489| (- 3)) (* |v_mult_#in~n_5482| (- 3)) (* v_mult_~n_BEFORE_CALL_203 (- 5)) (* |v_mult_#in~n_5491| (- 3)) 2147483646) 2) (* 2 |v_mult_#in~n_5482|)) (<= |v_mult_#in~n_5491| |v_mult_#in~n_5482|))) (exists ((aux_mod_v_mult_~n_BEFORE_CALL_203_88 Int) (|v_mult_#in~n_5907| Int) (|v_mult_#in~n_5899| Int) (aux_div_v_mult_~n_BEFORE_CALL_203_88 Int)) (and (<= |v_mult_#in~n_5907| v_mult_~n_BEFORE_CALL_204) (<= (+ aux_mod_v_mult_~n_BEFORE_CALL_203_88 (* 3 |v_mult_#in~n_5899|) (* 2 aux_div_v_mult_~n_BEFORE_CALL_203_88) |v_mult_#in~n_BEFORE_CALL_156|) 2147483646) (forall ((|v_mult_#in~n_5489| Int) (|v_mult_#in~n_5491| Int) (|v_mult_#in~n_5482| Int)) (or (< |v_mult_#in~n_5482| |v_mult_#in~n_5491|) (<= (* 2 |v_mult_#in~n_5482|) (div (+ (* |v_mult_#in~n_5489| (- 3)) (- 8589934584) (* aux_div_v_mult_~n_BEFORE_CALL_203_88 10) (* |v_mult_#in~n_5482| (- 3)) (* |v_mult_#in~n_5899| 15) (* aux_mod_v_mult_~n_BEFORE_CALL_203_88 5) (* |v_mult_#in~n_5491| (- 3))) 2)) (< 2147483646 (+ aux_mod_v_mult_~n_BEFORE_CALL_203_88 (* 3 |v_mult_#in~n_5899|) (* 2 aux_div_v_mult_~n_BEFORE_CALL_203_88) |v_mult_#in~n_5489|)) (< |v_mult_#in~n_5489| |v_mult_#in~n_5482|))) (< aux_mod_v_mult_~n_BEFORE_CALL_203_88 2) (< aux_div_v_mult_~n_BEFORE_CALL_203_88 (+ (* 2 |v_mult_#in~n_5907|) (* 5 v_mult_~n_BEFORE_CALL_204))) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_203_88) (<= |v_mult_#in~n_5899| |v_mult_#in~n_5907|))) (< v_mult_~n_BEFORE_CALL_204 |c_mult_#in~n|) (<= (+ v_mult_~n_BEFORE_CALL_204 v_mult_~n_BEFORE_CALL_203 |c_mult_#t~ret8| c_mult_~n) 2147483647))) is different from true [2021-11-12 23:42:47,279 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_mult_#in~n_6258| Int) (|v_mult_#in~n_6259| Int) (|v_mult_#in~n_BEFORE_CALL_156| Int) (v_mult_~n_BEFORE_CALL_203 Int) (v_mult_~n_BEFORE_CALL_204 Int) (|v_mult_#in~n_6256| Int) (|v_mult_#in~n_6257| Int) (|v_mult_#in~n_6261| Int) (|v_mult_#in~n_6260| Int)) (or (< |v_mult_#in~n_6260| |v_mult_#in~n_6259|) (< v_mult_~n_BEFORE_CALL_203 |v_mult_#in~n_BEFORE_CALL_156|) (< c_mult_~n |v_mult_#in~n_6258|) (< |v_mult_#in~n_6257| |v_mult_#in~n_6256|) (<= (+ (* 3 |v_mult_#in~n_6256|) v_mult_~n_BEFORE_CALL_204 v_mult_~n_BEFORE_CALL_203 (* 2 |v_mult_#in~n_6261|) (* 3 |v_mult_#in~n_6260|) (* 2 |v_mult_#in~n_6258|) (* 2 |v_mult_#in~n_6257|) (* 2 c_mult_~n) (* 2 |v_mult_#in~n_6259|)) 2147483646) (exists ((|v_mult_#in~n_5489| Int) (|v_mult_#in~n_5491| Int) (|v_mult_#in~n_5482| Int)) (and (<= |v_mult_#in~n_5489| v_mult_~n_BEFORE_CALL_203) (<= |v_mult_#in~n_5482| |v_mult_#in~n_5489|) (< (div (+ (* |v_mult_#in~n_5489| (- 3)) (* |v_mult_#in~n_5482| (- 3)) (* v_mult_~n_BEFORE_CALL_203 (- 5)) (* |v_mult_#in~n_5491| (- 3)) 2147483646) 2) (* 2 |v_mult_#in~n_5482|)) (<= |v_mult_#in~n_5491| |v_mult_#in~n_5482|))) (< |v_mult_#in~n_6261| |v_mult_#in~n_6257|) (exists ((aux_mod_v_mult_~n_BEFORE_CALL_203_88 Int) (|v_mult_#in~n_5907| Int) (|v_mult_#in~n_5899| Int) (aux_div_v_mult_~n_BEFORE_CALL_203_88 Int)) (and (<= |v_mult_#in~n_5907| v_mult_~n_BEFORE_CALL_204) (<= (+ aux_mod_v_mult_~n_BEFORE_CALL_203_88 (* 3 |v_mult_#in~n_5899|) (* 2 aux_div_v_mult_~n_BEFORE_CALL_203_88) |v_mult_#in~n_BEFORE_CALL_156|) 2147483646) (forall ((|v_mult_#in~n_5489| Int) (|v_mult_#in~n_5491| Int) (|v_mult_#in~n_5482| Int)) (or (< |v_mult_#in~n_5482| |v_mult_#in~n_5491|) (<= (* 2 |v_mult_#in~n_5482|) (div (+ (* |v_mult_#in~n_5489| (- 3)) (- 8589934584) (* aux_div_v_mult_~n_BEFORE_CALL_203_88 10) (* |v_mult_#in~n_5482| (- 3)) (* |v_mult_#in~n_5899| 15) (* aux_mod_v_mult_~n_BEFORE_CALL_203_88 5) (* |v_mult_#in~n_5491| (- 3))) 2)) (< 2147483646 (+ aux_mod_v_mult_~n_BEFORE_CALL_203_88 (* 3 |v_mult_#in~n_5899|) (* 2 aux_div_v_mult_~n_BEFORE_CALL_203_88) |v_mult_#in~n_5489|)) (< |v_mult_#in~n_5489| |v_mult_#in~n_5482|))) (< aux_mod_v_mult_~n_BEFORE_CALL_203_88 2) (< aux_div_v_mult_~n_BEFORE_CALL_203_88 (+ (* 2 |v_mult_#in~n_5907|) (* 5 v_mult_~n_BEFORE_CALL_204))) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_203_88) (<= |v_mult_#in~n_5899| |v_mult_#in~n_5907|))) (< v_mult_~n_BEFORE_CALL_204 |c_mult_#in~n|) (< |v_mult_#in~n_6258| |v_mult_#in~n_6261|) (< |v_mult_#in~n_6256| |v_mult_#in~n_6260|))) is different from false [2021-11-12 23:42:49,296 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_mult_#in~n_6258| Int) (|v_mult_#in~n_6259| Int) (|v_mult_#in~n_BEFORE_CALL_156| Int) (v_mult_~n_BEFORE_CALL_203 Int) (v_mult_~n_BEFORE_CALL_204 Int) (|v_mult_#in~n_6256| Int) (|v_mult_#in~n_6257| Int) (|v_mult_#in~n_6261| Int) (|v_mult_#in~n_6260| Int)) (or (< |v_mult_#in~n_6260| |v_mult_#in~n_6259|) (< v_mult_~n_BEFORE_CALL_203 |v_mult_#in~n_BEFORE_CALL_156|) (< c_mult_~n |v_mult_#in~n_6258|) (< |v_mult_#in~n_6257| |v_mult_#in~n_6256|) (<= (+ (* 3 |v_mult_#in~n_6256|) v_mult_~n_BEFORE_CALL_204 v_mult_~n_BEFORE_CALL_203 (* 2 |v_mult_#in~n_6261|) (* 3 |v_mult_#in~n_6260|) (* 2 |v_mult_#in~n_6258|) (* 2 |v_mult_#in~n_6257|) (* 2 c_mult_~n) (* 2 |v_mult_#in~n_6259|)) 2147483646) (exists ((|v_mult_#in~n_5489| Int) (|v_mult_#in~n_5491| Int) (|v_mult_#in~n_5482| Int)) (and (<= |v_mult_#in~n_5489| v_mult_~n_BEFORE_CALL_203) (<= |v_mult_#in~n_5482| |v_mult_#in~n_5489|) (< (div (+ (* |v_mult_#in~n_5489| (- 3)) (* |v_mult_#in~n_5482| (- 3)) (* v_mult_~n_BEFORE_CALL_203 (- 5)) (* |v_mult_#in~n_5491| (- 3)) 2147483646) 2) (* 2 |v_mult_#in~n_5482|)) (<= |v_mult_#in~n_5491| |v_mult_#in~n_5482|))) (< |v_mult_#in~n_6261| |v_mult_#in~n_6257|) (exists ((aux_mod_v_mult_~n_BEFORE_CALL_203_88 Int) (|v_mult_#in~n_5907| Int) (|v_mult_#in~n_5899| Int) (aux_div_v_mult_~n_BEFORE_CALL_203_88 Int)) (and (<= |v_mult_#in~n_5907| v_mult_~n_BEFORE_CALL_204) (<= (+ aux_mod_v_mult_~n_BEFORE_CALL_203_88 (* 3 |v_mult_#in~n_5899|) (* 2 aux_div_v_mult_~n_BEFORE_CALL_203_88) |v_mult_#in~n_BEFORE_CALL_156|) 2147483646) (forall ((|v_mult_#in~n_5489| Int) (|v_mult_#in~n_5491| Int) (|v_mult_#in~n_5482| Int)) (or (< |v_mult_#in~n_5482| |v_mult_#in~n_5491|) (<= (* 2 |v_mult_#in~n_5482|) (div (+ (* |v_mult_#in~n_5489| (- 3)) (- 8589934584) (* aux_div_v_mult_~n_BEFORE_CALL_203_88 10) (* |v_mult_#in~n_5482| (- 3)) (* |v_mult_#in~n_5899| 15) (* aux_mod_v_mult_~n_BEFORE_CALL_203_88 5) (* |v_mult_#in~n_5491| (- 3))) 2)) (< 2147483646 (+ aux_mod_v_mult_~n_BEFORE_CALL_203_88 (* 3 |v_mult_#in~n_5899|) (* 2 aux_div_v_mult_~n_BEFORE_CALL_203_88) |v_mult_#in~n_5489|)) (< |v_mult_#in~n_5489| |v_mult_#in~n_5482|))) (< aux_mod_v_mult_~n_BEFORE_CALL_203_88 2) (< aux_div_v_mult_~n_BEFORE_CALL_203_88 (+ (* 2 |v_mult_#in~n_5907|) (* 5 v_mult_~n_BEFORE_CALL_204))) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_203_88) (<= |v_mult_#in~n_5899| |v_mult_#in~n_5907|))) (< v_mult_~n_BEFORE_CALL_204 |c_mult_#in~n|) (< |v_mult_#in~n_6258| |v_mult_#in~n_6261|) (< |v_mult_#in~n_6256| |v_mult_#in~n_6260|))) is different from true [2021-11-12 23:42:49,320 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [|v_mult_#in~n_BEFORE_CALL_156|, v_mult_~n_BEFORE_CALL_203, v_mult_~n_BEFORE_CALL_204] [2021-11-12 23:42:49,320 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [329016490] [2021-11-12 23:42:49,321 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2021-11-12 23:42:49,321 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:42:49,322 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-12 23:42:49,322 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-12 23:42:49,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2021-11-12 23:42:49,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244552642] [2021-11-12 23:42:49,322 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-12 23:42:49,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-11-12 23:42:49,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:42:49,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-11-12 23:42:49,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=3935, Unknown=9, NotChecked=516, Total=4692 [2021-11-12 23:42:49,325 INFO L87 Difference]: Start difference. First operand 244 states and 266 transitions. Second operand has 42 states, 41 states have (on average 2.4146341463414633) internal successors, (99), 41 states have internal predecessors, (99), 4 states have call successors, (5), 2 states have call predecessors, (5), 19 states have return successors, (19), 19 states have call predecessors, (19), 3 states have call successors, (19) [2021-11-12 23:42:54,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:42:54,664 INFO L93 Difference]: Finished difference Result 253 states and 276 transitions. [2021-11-12 23:42:54,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-11-12 23:42:54,665 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.4146341463414633) internal successors, (99), 41 states have internal predecessors, (99), 4 states have call successors, (5), 2 states have call predecessors, (5), 19 states have return successors, (19), 19 states have call predecessors, (19), 3 states have call successors, (19) Word has length 248 [2021-11-12 23:42:54,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:42:54,667 INFO L225 Difference]: With dead ends: 253 [2021-11-12 23:42:54,667 INFO L226 Difference]: Without dead ends: 250 [2021-11-12 23:42:54,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 241 SyntacticMatches, 16 SemanticMatches, 104 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1739 ImplicationChecksByTransitivity, 28.6s TimeCoverageRelationStatistics Valid=616, Invalid=9693, Unknown=9, NotChecked=812, Total=11130 [2021-11-12 23:42:54,671 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 204 mSDsluCounter, 2771 mSDsCounter, 0 mSdLazyCounter, 2754 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2450.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 2765 SdHoareTripleChecker+Invalid, 2882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.75ms SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 2754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2722.79ms IncrementalHoareTripleChecker+Time [2021-11-12 23:42:54,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 2765 Invalid, 2882 Unknown, 0 Unchecked, 11.75ms Time], IncrementalHoareTripleChecker [128 Valid, 2754 Invalid, 0 Unknown, 0 Unchecked, 2722.79ms Time] [2021-11-12 23:42:54,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-11-12 23:42:54,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2021-11-12 23:42:54,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 200 states have (on average 1.08) internal successors, (216), 200 states have internal predecessors, (216), 19 states have call successors, (19), 12 states have call predecessors, (19), 29 states have return successors, (36), 36 states have call predecessors, (36), 18 states have call successors, (36) [2021-11-12 23:42:54,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 271 transitions. [2021-11-12 23:42:54,685 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 271 transitions. Word has length 248 [2021-11-12 23:42:54,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:42:54,686 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 271 transitions. [2021-11-12 23:42:54,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.4146341463414633) internal successors, (99), 41 states have internal predecessors, (99), 4 states have call successors, (5), 2 states have call predecessors, (5), 19 states have return successors, (19), 19 states have call predecessors, (19), 3 states have call successors, (19) [2021-11-12 23:42:54,687 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 271 transitions. [2021-11-12 23:42:54,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2021-11-12 23:42:54,689 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:42:54,690 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:42:54,745 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2021-11-12 23:42:54,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-11-12 23:42:54,923 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-12 23:42:54,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:42:54,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1620891236, now seen corresponding path program 14 times [2021-11-12 23:42:54,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:42:54,924 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343797807] [2021-11-12 23:42:54,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:42:54,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:42:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:42:57,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2110 backedges. 0 proven. 1021 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2021-11-12 23:42:57,030 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:42:57,030 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343797807] [2021-11-12 23:42:57,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343797807] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:42:57,030 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654985151] [2021-11-12 23:42:57,031 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-12 23:42:57,031 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:42:57,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:42:57,032 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:42:57,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-11-12 23:42:58,212 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2021-11-12 23:42:58,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-12 23:42:58,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 78 conjunts are in the unsatisfiable core [2021-11-12 23:42:58,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:43:02,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2110 backedges. 0 proven. 1021 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2021-11-12 23:43:02,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:44:31,166 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_225 Int) (v_mult_~n_BEFORE_CALL_226 Int) (|v_mult_#in~n_BEFORE_CALL_176| Int)) (or (exists ((|v_mult_#in~n_6773| Int) (|v_mult_#in~n_6774| Int)) (and (<= |v_mult_#in~n_6773| |v_mult_#in~n_6774|) (<= |v_mult_#in~n_6774| v_mult_~n_BEFORE_CALL_225) (< (div (+ (* |v_mult_#in~n_6774| (- 5)) 2147483646) 2) (+ (* 3 v_mult_~n_BEFORE_CALL_225) (* 4 |v_mult_#in~n_6773|))))) (< v_mult_~n_BEFORE_CALL_226 |c_mult_#in~n|) (< v_mult_~n_BEFORE_CALL_225 |v_mult_#in~n_BEFORE_CALL_176|) (exists ((aux_mod_aux_div_v_mult_~n_BEFORE_CALL_225_118_79 Int) (|v_mult_#in~n_7244| Int) (|v_mult_#in~n_7233| Int) (aux_div_aux_div_v_mult_~n_BEFORE_CALL_225_118_79 Int) (|v_mult_#in~n_7232| Int) (aux_mod_v_mult_~n_BEFORE_CALL_225_118 Int)) (and (< aux_div_aux_div_v_mult_~n_BEFORE_CALL_225_118_79 (* 2 v_mult_~n_BEFORE_CALL_226)) (<= |v_mult_#in~n_7244| v_mult_~n_BEFORE_CALL_226) (<= 0 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_225_118_79) (< aux_mod_aux_div_v_mult_~n_BEFORE_CALL_225_118_79 2) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_225_118) (<= |v_mult_#in~n_7232| |v_mult_#in~n_7233|) (<= (+ (* 4 aux_div_aux_div_v_mult_~n_BEFORE_CALL_225_118_79) (* 3 |v_mult_#in~n_7244|) (* 5 |v_mult_#in~n_7233|) aux_mod_v_mult_~n_BEFORE_CALL_225_118 |v_mult_#in~n_BEFORE_CALL_176| (* 2 |v_mult_#in~n_7232|) (* 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_225_118_79)) 2147483646) (forall ((|v_mult_#in~n_6773| Int) (|v_mult_#in~n_6774| Int)) (or (<= (+ 6442450938 (* 4 |v_mult_#in~n_6773|)) (+ (* 12 aux_div_aux_div_v_mult_~n_BEFORE_CALL_225_118_79) (* 3 aux_mod_v_mult_~n_BEFORE_CALL_225_118) (div (+ (* |v_mult_#in~n_6774| (- 5)) 2147483646) 2) (* 9 |v_mult_#in~n_7244|) (* 6 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_225_118_79) (* 15 |v_mult_#in~n_7233|) (* 6 |v_mult_#in~n_7232|))) (< 2147483646 (+ (* 4 aux_div_aux_div_v_mult_~n_BEFORE_CALL_225_118_79) (* 3 |v_mult_#in~n_7244|) (* 5 |v_mult_#in~n_7233|) aux_mod_v_mult_~n_BEFORE_CALL_225_118 (* 2 |v_mult_#in~n_7232|) (* 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_225_118_79) |v_mult_#in~n_6774|)) (< |v_mult_#in~n_6774| |v_mult_#in~n_6773|))) (<= |v_mult_#in~n_7233| |v_mult_#in~n_7244|) (< aux_mod_v_mult_~n_BEFORE_CALL_225_118 2))) (<= (+ v_mult_~n_BEFORE_CALL_226 v_mult_~n_BEFORE_CALL_225 |c_mult_#res|) 2147483647))) is different from false [2021-11-12 23:44:44,047 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_mult_~n_BEFORE_CALL_225 Int) (v_mult_~n_BEFORE_CALL_226 Int) (|v_mult_#in~n_BEFORE_CALL_176| Int)) (or (exists ((|v_mult_#in~n_6773| Int) (|v_mult_#in~n_6774| Int)) (and (<= |v_mult_#in~n_6773| |v_mult_#in~n_6774|) (<= |v_mult_#in~n_6774| v_mult_~n_BEFORE_CALL_225) (< (div (+ (* |v_mult_#in~n_6774| (- 5)) 2147483646) 2) (+ (* 3 v_mult_~n_BEFORE_CALL_225) (* 4 |v_mult_#in~n_6773|))))) (< v_mult_~n_BEFORE_CALL_226 |c_mult_#in~n|) (<= (+ v_mult_~n_BEFORE_CALL_226 v_mult_~n_BEFORE_CALL_225 |c_mult_#t~ret8| c_mult_~n) 2147483647) (< v_mult_~n_BEFORE_CALL_225 |v_mult_#in~n_BEFORE_CALL_176|) (exists ((aux_mod_aux_div_v_mult_~n_BEFORE_CALL_225_118_79 Int) (|v_mult_#in~n_7244| Int) (|v_mult_#in~n_7233| Int) (aux_div_aux_div_v_mult_~n_BEFORE_CALL_225_118_79 Int) (|v_mult_#in~n_7232| Int) (aux_mod_v_mult_~n_BEFORE_CALL_225_118 Int)) (and (< aux_div_aux_div_v_mult_~n_BEFORE_CALL_225_118_79 (* 2 v_mult_~n_BEFORE_CALL_226)) (<= |v_mult_#in~n_7244| v_mult_~n_BEFORE_CALL_226) (<= 0 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_225_118_79) (< aux_mod_aux_div_v_mult_~n_BEFORE_CALL_225_118_79 2) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_225_118) (<= |v_mult_#in~n_7232| |v_mult_#in~n_7233|) (<= (+ (* 4 aux_div_aux_div_v_mult_~n_BEFORE_CALL_225_118_79) (* 3 |v_mult_#in~n_7244|) (* 5 |v_mult_#in~n_7233|) aux_mod_v_mult_~n_BEFORE_CALL_225_118 |v_mult_#in~n_BEFORE_CALL_176| (* 2 |v_mult_#in~n_7232|) (* 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_225_118_79)) 2147483646) (forall ((|v_mult_#in~n_6773| Int) (|v_mult_#in~n_6774| Int)) (or (<= (+ 6442450938 (* 4 |v_mult_#in~n_6773|)) (+ (* 12 aux_div_aux_div_v_mult_~n_BEFORE_CALL_225_118_79) (* 3 aux_mod_v_mult_~n_BEFORE_CALL_225_118) (div (+ (* |v_mult_#in~n_6774| (- 5)) 2147483646) 2) (* 9 |v_mult_#in~n_7244|) (* 6 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_225_118_79) (* 15 |v_mult_#in~n_7233|) (* 6 |v_mult_#in~n_7232|))) (< 2147483646 (+ (* 4 aux_div_aux_div_v_mult_~n_BEFORE_CALL_225_118_79) (* 3 |v_mult_#in~n_7244|) (* 5 |v_mult_#in~n_7233|) aux_mod_v_mult_~n_BEFORE_CALL_225_118 (* 2 |v_mult_#in~n_7232|) (* 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_225_118_79) |v_mult_#in~n_6774|)) (< |v_mult_#in~n_6774| |v_mult_#in~n_6773|))) (<= |v_mult_#in~n_7233| |v_mult_#in~n_7244|) (< aux_mod_v_mult_~n_BEFORE_CALL_225_118 2))))) is different from false [2021-11-12 23:45:41,099 WARN L838 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_mult_~n_BEFORE_CALL_226_172 Int) (v_mult_~n_BEFORE_CALL_225 Int) (|v_mult_#in~n_BEFORE_CALL_176| Int) (|v_mult_#in~n_7654| Int) (|v_mult_#in~n_7642| Int) (aux_div_v_mult_~n_BEFORE_CALL_226_172 Int)) (let ((.cse0 (* 3 |v_mult_#in~n_7642|))) (or (exists ((|v_mult_#in~n_6773| Int) (|v_mult_#in~n_6774| Int)) (and (<= |v_mult_#in~n_6773| |v_mult_#in~n_6774|) (<= |v_mult_#in~n_6774| v_mult_~n_BEFORE_CALL_225) (< (div (+ (* |v_mult_#in~n_6774| (- 5)) 2147483646) 2) (+ (* 3 v_mult_~n_BEFORE_CALL_225) (* 4 |v_mult_#in~n_6773|))))) (<= (+ .cse0 c_mult_~n |v_mult_#in~n_7654|) aux_div_v_mult_~n_BEFORE_CALL_226_172) (<= 2 aux_mod_v_mult_~n_BEFORE_CALL_226_172) (exists ((aux_mod_aux_div_v_mult_~n_BEFORE_CALL_225_118_79 Int) (|v_mult_#in~n_7244| Int) (|v_mult_#in~n_7233| Int) (aux_div_aux_div_v_mult_~n_BEFORE_CALL_225_118_79 Int) (|v_mult_#in~n_7232| Int) (aux_mod_v_mult_~n_BEFORE_CALL_225_118 Int)) (and (< (+ (* 4 aux_div_v_mult_~n_BEFORE_CALL_226_172) (* 6 |v_mult_#in~n_7654|) (* 2 aux_mod_v_mult_~n_BEFORE_CALL_226_172) (* 2 c_mult_~n) (* 6 |v_mult_#in~n_7642|) aux_div_aux_div_v_mult_~n_BEFORE_CALL_225_118_79 (* 2 v_mult_~n_BEFORE_CALL_225)) 4294967292) (<= 0 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_225_118_79) (< aux_mod_aux_div_v_mult_~n_BEFORE_CALL_225_118_79 2) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_225_118) (<= |v_mult_#in~n_7232| |v_mult_#in~n_7233|) (<= (+ (* 4 aux_div_aux_div_v_mult_~n_BEFORE_CALL_225_118_79) (* 3 |v_mult_#in~n_7244|) (* 5 |v_mult_#in~n_7233|) aux_mod_v_mult_~n_BEFORE_CALL_225_118 |v_mult_#in~n_BEFORE_CALL_176| (* 2 |v_mult_#in~n_7232|) (* 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_225_118_79)) 2147483646) (forall ((|v_mult_#in~n_6773| Int) (|v_mult_#in~n_6774| Int)) (or (<= (+ 6442450938 (* 4 |v_mult_#in~n_6773|)) (+ (* 12 aux_div_aux_div_v_mult_~n_BEFORE_CALL_225_118_79) (* 3 aux_mod_v_mult_~n_BEFORE_CALL_225_118) (div (+ (* |v_mult_#in~n_6774| (- 5)) 2147483646) 2) (* 9 |v_mult_#in~n_7244|) (* 6 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_225_118_79) (* 15 |v_mult_#in~n_7233|) (* 6 |v_mult_#in~n_7232|))) (< 2147483646 (+ (* 4 aux_div_aux_div_v_mult_~n_BEFORE_CALL_225_118_79) (* 3 |v_mult_#in~n_7244|) (* 5 |v_mult_#in~n_7233|) aux_mod_v_mult_~n_BEFORE_CALL_225_118 (* 2 |v_mult_#in~n_7232|) (* 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_225_118_79) |v_mult_#in~n_6774|)) (< |v_mult_#in~n_6774| |v_mult_#in~n_6773|))) (<= |v_mult_#in~n_7233| |v_mult_#in~n_7244|) (< aux_mod_v_mult_~n_BEFORE_CALL_225_118 2) (<= (+ (* 3 |v_mult_#in~n_7642|) v_mult_~n_BEFORE_CALL_225 aux_mod_v_mult_~n_BEFORE_CALL_226_172 (* 3 |v_mult_#in~n_7654|) (* 2 aux_div_v_mult_~n_BEFORE_CALL_226_172) c_mult_~n |v_mult_#in~n_7244|) 2147483646))) (< c_mult_~n |v_mult_#in~n_7654|) (< v_mult_~n_BEFORE_CALL_225 |v_mult_#in~n_BEFORE_CALL_176|) (< 2147483646 (+ .cse0 v_mult_~n_BEFORE_CALL_225 aux_mod_v_mult_~n_BEFORE_CALL_226_172 (* 3 |v_mult_#in~n_7654|) (* 2 aux_div_v_mult_~n_BEFORE_CALL_226_172) |c_mult_#in~n| c_mult_~n)) (< |v_mult_#in~n_7654| |v_mult_#in~n_7642|) (< aux_mod_v_mult_~n_BEFORE_CALL_226_172 0)))) is different from false [2021-11-12 23:45:43,206 WARN L860 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_mult_~n_BEFORE_CALL_226_172 Int) (v_mult_~n_BEFORE_CALL_225 Int) (|v_mult_#in~n_BEFORE_CALL_176| Int) (|v_mult_#in~n_7654| Int) (|v_mult_#in~n_7642| Int) (aux_div_v_mult_~n_BEFORE_CALL_226_172 Int)) (let ((.cse0 (* 3 |v_mult_#in~n_7642|))) (or (exists ((|v_mult_#in~n_6773| Int) (|v_mult_#in~n_6774| Int)) (and (<= |v_mult_#in~n_6773| |v_mult_#in~n_6774|) (<= |v_mult_#in~n_6774| v_mult_~n_BEFORE_CALL_225) (< (div (+ (* |v_mult_#in~n_6774| (- 5)) 2147483646) 2) (+ (* 3 v_mult_~n_BEFORE_CALL_225) (* 4 |v_mult_#in~n_6773|))))) (<= (+ .cse0 c_mult_~n |v_mult_#in~n_7654|) aux_div_v_mult_~n_BEFORE_CALL_226_172) (<= 2 aux_mod_v_mult_~n_BEFORE_CALL_226_172) (exists ((aux_mod_aux_div_v_mult_~n_BEFORE_CALL_225_118_79 Int) (|v_mult_#in~n_7244| Int) (|v_mult_#in~n_7233| Int) (aux_div_aux_div_v_mult_~n_BEFORE_CALL_225_118_79 Int) (|v_mult_#in~n_7232| Int) (aux_mod_v_mult_~n_BEFORE_CALL_225_118 Int)) (and (< (+ (* 4 aux_div_v_mult_~n_BEFORE_CALL_226_172) (* 6 |v_mult_#in~n_7654|) (* 2 aux_mod_v_mult_~n_BEFORE_CALL_226_172) (* 2 c_mult_~n) (* 6 |v_mult_#in~n_7642|) aux_div_aux_div_v_mult_~n_BEFORE_CALL_225_118_79 (* 2 v_mult_~n_BEFORE_CALL_225)) 4294967292) (<= 0 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_225_118_79) (< aux_mod_aux_div_v_mult_~n_BEFORE_CALL_225_118_79 2) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_225_118) (<= |v_mult_#in~n_7232| |v_mult_#in~n_7233|) (<= (+ (* 4 aux_div_aux_div_v_mult_~n_BEFORE_CALL_225_118_79) (* 3 |v_mult_#in~n_7244|) (* 5 |v_mult_#in~n_7233|) aux_mod_v_mult_~n_BEFORE_CALL_225_118 |v_mult_#in~n_BEFORE_CALL_176| (* 2 |v_mult_#in~n_7232|) (* 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_225_118_79)) 2147483646) (forall ((|v_mult_#in~n_6773| Int) (|v_mult_#in~n_6774| Int)) (or (<= (+ 6442450938 (* 4 |v_mult_#in~n_6773|)) (+ (* 12 aux_div_aux_div_v_mult_~n_BEFORE_CALL_225_118_79) (* 3 aux_mod_v_mult_~n_BEFORE_CALL_225_118) (div (+ (* |v_mult_#in~n_6774| (- 5)) 2147483646) 2) (* 9 |v_mult_#in~n_7244|) (* 6 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_225_118_79) (* 15 |v_mult_#in~n_7233|) (* 6 |v_mult_#in~n_7232|))) (< 2147483646 (+ (* 4 aux_div_aux_div_v_mult_~n_BEFORE_CALL_225_118_79) (* 3 |v_mult_#in~n_7244|) (* 5 |v_mult_#in~n_7233|) aux_mod_v_mult_~n_BEFORE_CALL_225_118 (* 2 |v_mult_#in~n_7232|) (* 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_225_118_79) |v_mult_#in~n_6774|)) (< |v_mult_#in~n_6774| |v_mult_#in~n_6773|))) (<= |v_mult_#in~n_7233| |v_mult_#in~n_7244|) (< aux_mod_v_mult_~n_BEFORE_CALL_225_118 2) (<= (+ (* 3 |v_mult_#in~n_7642|) v_mult_~n_BEFORE_CALL_225 aux_mod_v_mult_~n_BEFORE_CALL_226_172 (* 3 |v_mult_#in~n_7654|) (* 2 aux_div_v_mult_~n_BEFORE_CALL_226_172) c_mult_~n |v_mult_#in~n_7244|) 2147483646))) (< c_mult_~n |v_mult_#in~n_7654|) (< v_mult_~n_BEFORE_CALL_225 |v_mult_#in~n_BEFORE_CALL_176|) (< 2147483646 (+ .cse0 v_mult_~n_BEFORE_CALL_225 aux_mod_v_mult_~n_BEFORE_CALL_226_172 (* 3 |v_mult_#in~n_7654|) (* 2 aux_div_v_mult_~n_BEFORE_CALL_226_172) |c_mult_#in~n| c_mult_~n)) (< |v_mult_#in~n_7654| |v_mult_#in~n_7642|) (< aux_mod_v_mult_~n_BEFORE_CALL_226_172 0)))) is different from true [2021-11-12 23:45:43,221 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [v_mult_~n_BEFORE_CALL_225, |v_mult_#in~n_BEFORE_CALL_176|] [2021-11-12 23:45:43,221 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1985207188] [2021-11-12 23:45:43,222 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2021-11-12 23:45:43,223 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:45:43,223 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-12 23:45:43,223 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-12 23:45:43,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2021-11-12 23:45:43,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017072725] [2021-11-12 23:45:43,224 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-12 23:45:43,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-11-12 23:45:43,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:45:43,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-11-12 23:45:43,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=4432, Unknown=6, NotChecked=408, Total=5112 [2021-11-12 23:45:43,225 INFO L87 Difference]: Start difference. First operand 249 states and 271 transitions. Second operand has 44 states, 43 states have (on average 2.395348837209302) internal successors, (103), 43 states have internal predecessors, (103), 4 states have call successors, (4), 2 states have call predecessors, (4), 20 states have return successors, (20), 20 states have call predecessors, (20), 3 states have call successors, (20) [2021-11-12 23:45:52,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:45:52,738 INFO L93 Difference]: Finished difference Result 258 states and 281 transitions. [2021-11-12 23:45:52,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-11-12 23:45:52,739 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.395348837209302) internal successors, (103), 43 states have internal predecessors, (103), 4 states have call successors, (4), 2 states have call predecessors, (4), 20 states have return successors, (20), 20 states have call predecessors, (20), 3 states have call successors, (20) Word has length 246 [2021-11-12 23:45:52,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:45:52,741 INFO L225 Difference]: With dead ends: 258 [2021-11-12 23:45:52,741 INFO L226 Difference]: Without dead ends: 255 [2021-11-12 23:45:52,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 234 SyntacticMatches, 17 SemanticMatches, 109 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1994 ImplicationChecksByTransitivity, 70.6s TimeCoverageRelationStatistics Valid=710, Invalid=10852, Unknown=6, NotChecked=642, Total=12210 [2021-11-12 23:45:52,743 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 214 mSDsluCounter, 2952 mSDsCounter, 0 mSdLazyCounter, 3058 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4688.33ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 2943 SdHoareTripleChecker+Invalid, 3194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.26ms SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 3058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4977.73ms IncrementalHoareTripleChecker+Time [2021-11-12 23:45:52,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 2943 Invalid, 3194 Unknown, 0 Unchecked, 12.26ms Time], IncrementalHoareTripleChecker [136 Valid, 3058 Invalid, 0 Unknown, 0 Unchecked, 4977.73ms Time] [2021-11-12 23:45:52,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-11-12 23:45:52,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 254. [2021-11-12 23:45:52,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 204 states have (on average 1.0784313725490196) internal successors, (220), 204 states have internal predecessors, (220), 19 states have call successors, (19), 12 states have call predecessors, (19), 30 states have return successors, (37), 37 states have call predecessors, (37), 18 states have call successors, (37) [2021-11-12 23:45:52,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 276 transitions. [2021-11-12 23:45:52,757 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 276 transitions. Word has length 246 [2021-11-12 23:45:52,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:45:52,757 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 276 transitions. [2021-11-12 23:45:52,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.395348837209302) internal successors, (103), 43 states have internal predecessors, (103), 4 states have call successors, (4), 2 states have call predecessors, (4), 20 states have return successors, (20), 20 states have call predecessors, (20), 3 states have call successors, (20) [2021-11-12 23:45:52,758 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 276 transitions. [2021-11-12 23:45:52,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2021-11-12 23:45:52,760 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:45:52,761 INFO L514 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 22, 22, 20, 20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:45:52,807 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2021-11-12 23:45:52,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-11-12 23:45:52,975 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-12 23:45:52,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:45:52,976 INFO L85 PathProgramCache]: Analyzing trace with hash -780960536, now seen corresponding path program 15 times [2021-11-12 23:45:52,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:45:52,976 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117523998] [2021-11-12 23:45:52,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:45:52,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:45:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:45:56,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2636 backedges. 0 proven. 1399 refuted. 0 times theorem prover too weak. 1237 trivial. 0 not checked. [2021-11-12 23:45:56,863 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:45:56,863 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117523998] [2021-11-12 23:45:56,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117523998] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:45:56,863 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283558092] [2021-11-12 23:45:56,863 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-12 23:45:56,863 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:45:56,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:45:56,864 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:45:56,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-11-12 23:45:58,056 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-12 23:45:58,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-12 23:45:58,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 86 conjunts are in the unsatisfiable core [2021-11-12 23:45:58,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-12 23:46:06,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2636 backedges. 0 proven. 1399 refuted. 0 times theorem prover too weak. 1237 trivial. 0 not checked. [2021-11-12 23:46:06,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-12 23:46:55,695 WARN L860 $PredicateComparison]: unable to prove that (forall ((aux_mod_aux_div_v_mult_~n_BEFORE_CALL_250_107_45 Int) (|v_mult_#in~n_8741| Int) (aux_div_aux_div_v_mult_~n_BEFORE_CALL_250_107_45 Int) (aux_mod_v_mult_~n_BEFORE_CALL_250_107 Int)) (or (< c_mult_~n |v_mult_#in~n_8741|) (<= 2 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_250_107_45) (<= 3 aux_mod_v_mult_~n_BEFORE_CALL_250_107) (<= |v_mult_#in~n_8741| aux_div_aux_div_v_mult_~n_BEFORE_CALL_250_107_45) (< aux_mod_v_mult_~n_BEFORE_CALL_250_107 0) (exists ((|v_mult_#in~n_8211| Int)) (and (<= (+ (* 6 aux_div_aux_div_v_mult_~n_BEFORE_CALL_250_107_45) aux_mod_v_mult_~n_BEFORE_CALL_250_107 (* 3 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_250_107_45) (* 11 c_mult_~n) |v_mult_#in~n_8211| (* 2 |v_mult_#in~n_8741|)) 2147483646) (< (+ (* 12 |v_mult_#in~n_8741|) (* 36 aux_div_aux_div_v_mult_~n_BEFORE_CALL_250_107_45) (div (+ (* |v_mult_#in~n_8211| (- 2)) 2147483646) 3) (* 6 aux_mod_v_mult_~n_BEFORE_CALL_250_107) (* 18 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_250_107_45) (* 66 c_mult_~n)) 12884901876))) (< aux_mod_aux_div_v_mult_~n_BEFORE_CALL_250_107_45 0) (< 2147483646 (+ (* 6 aux_div_aux_div_v_mult_~n_BEFORE_CALL_250_107_45) aux_mod_v_mult_~n_BEFORE_CALL_250_107 (* 3 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_250_107_45) (* 11 c_mult_~n) |c_mult_#in~n| (* 2 |v_mult_#in~n_8741|))))) is different from true [2021-11-12 23:46:59,672 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_mult_#in~n_BEFORE_CALL_197| Int) (v_mult_~n_BEFORE_CALL_250 Int) (v_mult_~n_BEFORE_CALL_251 Int)) (or (exists ((aux_mod_aux_div_v_mult_~n_BEFORE_CALL_250_107_45 Int) (|v_mult_#in~n_8741| Int) (aux_div_aux_div_v_mult_~n_BEFORE_CALL_250_107_45 Int) (aux_mod_v_mult_~n_BEFORE_CALL_250_107 Int)) (and (<= |v_mult_#in~n_8741| v_mult_~n_BEFORE_CALL_251) (< aux_div_aux_div_v_mult_~n_BEFORE_CALL_250_107_45 |v_mult_#in~n_8741|) (<= 0 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_250_107_45) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_250_107) (< aux_mod_v_mult_~n_BEFORE_CALL_250_107 3) (forall ((|v_mult_#in~n_8211| Int)) (or (< 2147483646 (+ (* 6 aux_div_aux_div_v_mult_~n_BEFORE_CALL_250_107_45) aux_mod_v_mult_~n_BEFORE_CALL_250_107 (* 3 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_250_107_45) (* 11 v_mult_~n_BEFORE_CALL_251) |v_mult_#in~n_8211| (* 2 |v_mult_#in~n_8741|))) (<= 12884901876 (+ (* 12 |v_mult_#in~n_8741|) (* 36 aux_div_aux_div_v_mult_~n_BEFORE_CALL_250_107_45) (div (+ (* |v_mult_#in~n_8211| (- 2)) 2147483646) 3) (* 6 aux_mod_v_mult_~n_BEFORE_CALL_250_107) (* 66 v_mult_~n_BEFORE_CALL_251) (* 18 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_250_107_45))))) (<= (+ (* 6 aux_div_aux_div_v_mult_~n_BEFORE_CALL_250_107_45) aux_mod_v_mult_~n_BEFORE_CALL_250_107 (* 3 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_250_107_45) |v_mult_#in~n_BEFORE_CALL_197| (* 11 v_mult_~n_BEFORE_CALL_251) (* 2 |v_mult_#in~n_8741|)) 2147483646) (< aux_mod_aux_div_v_mult_~n_BEFORE_CALL_250_107_45 2))) (< v_mult_~n_BEFORE_CALL_251 |c_mult_#in~n|) (< v_mult_~n_BEFORE_CALL_250 |v_mult_#in~n_BEFORE_CALL_197|) (exists ((|v_mult_#in~n_8211| Int)) (and (< (div (+ (* |v_mult_#in~n_8211| (- 2)) 2147483646) 3) (* 6 v_mult_~n_BEFORE_CALL_250)) (<= |v_mult_#in~n_8211| v_mult_~n_BEFORE_CALL_250))) (<= (+ v_mult_~n_BEFORE_CALL_251 v_mult_~n_BEFORE_CALL_250 |c_mult_#res|) 2147483647))) is different from false [2021-11-12 23:47:05,445 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_mult_#in~n_BEFORE_CALL_197| Int) (v_mult_~n_BEFORE_CALL_250 Int) (v_mult_~n_BEFORE_CALL_251 Int)) (or (exists ((aux_mod_aux_div_v_mult_~n_BEFORE_CALL_250_107_45 Int) (|v_mult_#in~n_8741| Int) (aux_div_aux_div_v_mult_~n_BEFORE_CALL_250_107_45 Int) (aux_mod_v_mult_~n_BEFORE_CALL_250_107 Int)) (and (<= |v_mult_#in~n_8741| v_mult_~n_BEFORE_CALL_251) (< aux_div_aux_div_v_mult_~n_BEFORE_CALL_250_107_45 |v_mult_#in~n_8741|) (<= 0 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_250_107_45) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_250_107) (< aux_mod_v_mult_~n_BEFORE_CALL_250_107 3) (forall ((|v_mult_#in~n_8211| Int)) (or (< 2147483646 (+ (* 6 aux_div_aux_div_v_mult_~n_BEFORE_CALL_250_107_45) aux_mod_v_mult_~n_BEFORE_CALL_250_107 (* 3 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_250_107_45) (* 11 v_mult_~n_BEFORE_CALL_251) |v_mult_#in~n_8211| (* 2 |v_mult_#in~n_8741|))) (<= 12884901876 (+ (* 12 |v_mult_#in~n_8741|) (* 36 aux_div_aux_div_v_mult_~n_BEFORE_CALL_250_107_45) (div (+ (* |v_mult_#in~n_8211| (- 2)) 2147483646) 3) (* 6 aux_mod_v_mult_~n_BEFORE_CALL_250_107) (* 66 v_mult_~n_BEFORE_CALL_251) (* 18 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_250_107_45))))) (<= (+ (* 6 aux_div_aux_div_v_mult_~n_BEFORE_CALL_250_107_45) aux_mod_v_mult_~n_BEFORE_CALL_250_107 (* 3 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_250_107_45) |v_mult_#in~n_BEFORE_CALL_197| (* 11 v_mult_~n_BEFORE_CALL_251) (* 2 |v_mult_#in~n_8741|)) 2147483646) (< aux_mod_aux_div_v_mult_~n_BEFORE_CALL_250_107_45 2))) (< v_mult_~n_BEFORE_CALL_251 |c_mult_#in~n|) (< v_mult_~n_BEFORE_CALL_250 |v_mult_#in~n_BEFORE_CALL_197|) (exists ((|v_mult_#in~n_8211| Int)) (and (< (div (+ (* |v_mult_#in~n_8211| (- 2)) 2147483646) 3) (* 6 v_mult_~n_BEFORE_CALL_250)) (<= |v_mult_#in~n_8211| v_mult_~n_BEFORE_CALL_250))) (<= (+ v_mult_~n_BEFORE_CALL_251 v_mult_~n_BEFORE_CALL_250 |c_mult_#t~ret8| c_mult_~n) 2147483647))) is different from false [2021-11-12 23:47:39,407 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_mult_#in~n_9190| Int) (aux_mod_v_mult_~n_BEFORE_CALL_251_172 Int) (|v_mult_#in~n_9192| Int) (|v_mult_#in~n_BEFORE_CALL_197| Int) (|v_mult_#in~n_9188| Int) (v_mult_~n_BEFORE_CALL_250 Int) (aux_div_v_mult_~n_BEFORE_CALL_251_172 Int)) (or (< |v_mult_#in~n_9188| |v_mult_#in~n_9192|) (< aux_mod_v_mult_~n_BEFORE_CALL_251_172 0) (< v_mult_~n_BEFORE_CALL_250 |v_mult_#in~n_BEFORE_CALL_197|) (exists ((|v_mult_#in~n_8211| Int)) (and (< (div (+ (* |v_mult_#in~n_8211| (- 2)) 2147483646) 3) (* 6 v_mult_~n_BEFORE_CALL_250)) (<= |v_mult_#in~n_8211| v_mult_~n_BEFORE_CALL_250))) (exists ((aux_mod_aux_div_v_mult_~n_BEFORE_CALL_250_107_45 Int) (|v_mult_#in~n_8741| Int) (aux_div_aux_div_v_mult_~n_BEFORE_CALL_250_107_45 Int) (aux_mod_v_mult_~n_BEFORE_CALL_250_107 Int)) (and (< aux_div_aux_div_v_mult_~n_BEFORE_CALL_250_107_45 |v_mult_#in~n_8741|) (<= (+ v_mult_~n_BEFORE_CALL_250 (* 3 aux_div_v_mult_~n_BEFORE_CALL_251_172) aux_mod_v_mult_~n_BEFORE_CALL_251_172 (* 2 |v_mult_#in~n_9188|) (* 2 |v_mult_#in~n_9192|) (* 2 c_mult_~n) |v_mult_#in~n_8741|) 2147483646) (<= 0 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_250_107_45) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_250_107) (<= (+ (* 6 aux_div_aux_div_v_mult_~n_BEFORE_CALL_250_107_45) aux_mod_v_mult_~n_BEFORE_CALL_250_107 (* 3 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_250_107_45) |v_mult_#in~n_BEFORE_CALL_197| 21474836460 (* 2 |v_mult_#in~n_8741|)) (+ (* 11 aux_mod_v_mult_~n_BEFORE_CALL_251_172) (* 22 c_mult_~n) (* 11 v_mult_~n_BEFORE_CALL_250) (* 22 |v_mult_#in~n_9192|) (* 33 aux_div_v_mult_~n_BEFORE_CALL_251_172) (* 22 |v_mult_#in~n_9188|))) (< aux_mod_v_mult_~n_BEFORE_CALL_250_107 3) (< aux_mod_aux_div_v_mult_~n_BEFORE_CALL_250_107_45 2) (forall ((|v_mult_#in~n_8211| Int)) (or (< (+ (* 11 aux_mod_v_mult_~n_BEFORE_CALL_251_172) (* 22 c_mult_~n) (* 11 v_mult_~n_BEFORE_CALL_250) (* 22 |v_mult_#in~n_9192|) (* 33 aux_div_v_mult_~n_BEFORE_CALL_251_172) (* 22 |v_mult_#in~n_9188|)) (+ (* 6 aux_div_aux_div_v_mult_~n_BEFORE_CALL_250_107_45) aux_mod_v_mult_~n_BEFORE_CALL_250_107 (* 3 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_250_107_45) 21474836460 |v_mult_#in~n_8211| (* 2 |v_mult_#in~n_8741|))) (<= (+ (* 132 |v_mult_#in~n_9188|) (* 198 aux_div_v_mult_~n_BEFORE_CALL_251_172) (* 132 |v_mult_#in~n_9192|) (* 66 v_mult_~n_BEFORE_CALL_250) (* 66 aux_mod_v_mult_~n_BEFORE_CALL_251_172) (* 132 c_mult_~n)) (+ (* 12 |v_mult_#in~n_8741|) (* 36 aux_div_aux_div_v_mult_~n_BEFORE_CALL_250_107_45) 128849018760 (div (+ (* |v_mult_#in~n_8211| (- 2)) 2147483646) 3) (* 6 aux_mod_v_mult_~n_BEFORE_CALL_250_107) (* 18 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_250_107_45))))))) (< 2147483646 (+ v_mult_~n_BEFORE_CALL_250 (* 3 aux_div_v_mult_~n_BEFORE_CALL_251_172) aux_mod_v_mult_~n_BEFORE_CALL_251_172 (* 2 |v_mult_#in~n_9188|) (* 2 |v_mult_#in~n_9192|) (* 2 c_mult_~n) |c_mult_#in~n|)) (<= 3 aux_mod_v_mult_~n_BEFORE_CALL_251_172) (< |v_mult_#in~n_9192| |v_mult_#in~n_9190|) (< c_mult_~n |v_mult_#in~n_9188|) (<= (+ (* 3 |v_mult_#in~n_9190|) |v_mult_#in~n_9192|) aux_div_v_mult_~n_BEFORE_CALL_251_172))) is different from false [2021-11-12 23:47:41,432 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_mult_#in~n_9190| Int) (aux_mod_v_mult_~n_BEFORE_CALL_251_172 Int) (|v_mult_#in~n_9192| Int) (|v_mult_#in~n_BEFORE_CALL_197| Int) (|v_mult_#in~n_9188| Int) (v_mult_~n_BEFORE_CALL_250 Int) (aux_div_v_mult_~n_BEFORE_CALL_251_172 Int)) (or (< |v_mult_#in~n_9188| |v_mult_#in~n_9192|) (< aux_mod_v_mult_~n_BEFORE_CALL_251_172 0) (< v_mult_~n_BEFORE_CALL_250 |v_mult_#in~n_BEFORE_CALL_197|) (exists ((|v_mult_#in~n_8211| Int)) (and (< (div (+ (* |v_mult_#in~n_8211| (- 2)) 2147483646) 3) (* 6 v_mult_~n_BEFORE_CALL_250)) (<= |v_mult_#in~n_8211| v_mult_~n_BEFORE_CALL_250))) (exists ((aux_mod_aux_div_v_mult_~n_BEFORE_CALL_250_107_45 Int) (|v_mult_#in~n_8741| Int) (aux_div_aux_div_v_mult_~n_BEFORE_CALL_250_107_45 Int) (aux_mod_v_mult_~n_BEFORE_CALL_250_107 Int)) (and (< aux_div_aux_div_v_mult_~n_BEFORE_CALL_250_107_45 |v_mult_#in~n_8741|) (<= (+ v_mult_~n_BEFORE_CALL_250 (* 3 aux_div_v_mult_~n_BEFORE_CALL_251_172) aux_mod_v_mult_~n_BEFORE_CALL_251_172 (* 2 |v_mult_#in~n_9188|) (* 2 |v_mult_#in~n_9192|) (* 2 c_mult_~n) |v_mult_#in~n_8741|) 2147483646) (<= 0 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_250_107_45) (<= 0 aux_mod_v_mult_~n_BEFORE_CALL_250_107) (<= (+ (* 6 aux_div_aux_div_v_mult_~n_BEFORE_CALL_250_107_45) aux_mod_v_mult_~n_BEFORE_CALL_250_107 (* 3 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_250_107_45) |v_mult_#in~n_BEFORE_CALL_197| 21474836460 (* 2 |v_mult_#in~n_8741|)) (+ (* 11 aux_mod_v_mult_~n_BEFORE_CALL_251_172) (* 22 c_mult_~n) (* 11 v_mult_~n_BEFORE_CALL_250) (* 22 |v_mult_#in~n_9192|) (* 33 aux_div_v_mult_~n_BEFORE_CALL_251_172) (* 22 |v_mult_#in~n_9188|))) (< aux_mod_v_mult_~n_BEFORE_CALL_250_107 3) (< aux_mod_aux_div_v_mult_~n_BEFORE_CALL_250_107_45 2) (forall ((|v_mult_#in~n_8211| Int)) (or (< (+ (* 11 aux_mod_v_mult_~n_BEFORE_CALL_251_172) (* 22 c_mult_~n) (* 11 v_mult_~n_BEFORE_CALL_250) (* 22 |v_mult_#in~n_9192|) (* 33 aux_div_v_mult_~n_BEFORE_CALL_251_172) (* 22 |v_mult_#in~n_9188|)) (+ (* 6 aux_div_aux_div_v_mult_~n_BEFORE_CALL_250_107_45) aux_mod_v_mult_~n_BEFORE_CALL_250_107 (* 3 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_250_107_45) 21474836460 |v_mult_#in~n_8211| (* 2 |v_mult_#in~n_8741|))) (<= (+ (* 132 |v_mult_#in~n_9188|) (* 198 aux_div_v_mult_~n_BEFORE_CALL_251_172) (* 132 |v_mult_#in~n_9192|) (* 66 v_mult_~n_BEFORE_CALL_250) (* 66 aux_mod_v_mult_~n_BEFORE_CALL_251_172) (* 132 c_mult_~n)) (+ (* 12 |v_mult_#in~n_8741|) (* 36 aux_div_aux_div_v_mult_~n_BEFORE_CALL_250_107_45) 128849018760 (div (+ (* |v_mult_#in~n_8211| (- 2)) 2147483646) 3) (* 6 aux_mod_v_mult_~n_BEFORE_CALL_250_107) (* 18 aux_mod_aux_div_v_mult_~n_BEFORE_CALL_250_107_45))))))) (< 2147483646 (+ v_mult_~n_BEFORE_CALL_250 (* 3 aux_div_v_mult_~n_BEFORE_CALL_251_172) aux_mod_v_mult_~n_BEFORE_CALL_251_172 (* 2 |v_mult_#in~n_9188|) (* 2 |v_mult_#in~n_9192|) (* 2 c_mult_~n) |c_mult_#in~n|)) (<= 3 aux_mod_v_mult_~n_BEFORE_CALL_251_172) (< |v_mult_#in~n_9192| |v_mult_#in~n_9190|) (< c_mult_~n |v_mult_#in~n_9188|) (<= (+ (* 3 |v_mult_#in~n_9190|) |v_mult_#in~n_9192|) aux_div_v_mult_~n_BEFORE_CALL_251_172))) is different from true [2021-11-12 23:47:41,446 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [|v_mult_#in~n_BEFORE_CALL_197|, v_mult_~n_BEFORE_CALL_250] [2021-11-12 23:47:41,446 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1520005112] [2021-11-12 23:47:41,447 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2021-11-12 23:47:41,447 INFO L166 IcfgInterpreter]: Building call graph [2021-11-12 23:47:41,448 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-12 23:47:41,448 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-12 23:47:41,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2021-11-12 23:47:41,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86642458] [2021-11-12 23:47:41,448 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-12 23:47:41,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-11-12 23:47:41,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-12 23:47:41,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-11-12 23:47:41,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=4727, Unknown=5, NotChecked=564, Total=5550 [2021-11-12 23:47:41,450 INFO L87 Difference]: Start difference. First operand 254 states and 276 transitions. Second operand has 46 states, 45 states have (on average 2.3777777777777778) internal successors, (107), 45 states have internal predecessors, (107), 4 states have call successors, (5), 2 states have call predecessors, (5), 21 states have return successors, (21), 21 states have call predecessors, (21), 3 states have call successors, (21) [2021-11-12 23:47:51,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-12 23:47:51,878 INFO L93 Difference]: Finished difference Result 263 states and 286 transitions. [2021-11-12 23:47:51,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-11-12 23:47:51,878 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.3777777777777778) internal successors, (107), 45 states have internal predecessors, (107), 4 states have call successors, (5), 2 states have call predecessors, (5), 21 states have return successors, (21), 21 states have call predecessors, (21), 3 states have call successors, (21) Word has length 272 [2021-11-12 23:47:51,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-12 23:47:51,881 INFO L225 Difference]: With dead ends: 263 [2021-11-12 23:47:51,881 INFO L226 Difference]: Without dead ends: 260 [2021-11-12 23:47:51,883 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 263 SyntacticMatches, 18 SemanticMatches, 114 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2131 ImplicationChecksByTransitivity, 26.2s TimeCoverageRelationStatistics Valid=680, Invalid=11763, Unknown=5, NotChecked=892, Total=13340 [2021-11-12 23:47:51,884 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 224 mSDsluCounter, 3089 mSDsCounter, 0 mSdLazyCounter, 3374 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5199.59ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 3079 SdHoareTripleChecker+Invalid, 3516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.94ms SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 3374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5523.23ms IncrementalHoareTripleChecker+Time [2021-11-12 23:47:51,884 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 3079 Invalid, 3516 Unknown, 0 Unchecked, 13.94ms Time], IncrementalHoareTripleChecker [142 Valid, 3374 Invalid, 0 Unknown, 0 Unchecked, 5523.23ms Time] [2021-11-12 23:47:51,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-11-12 23:47:51,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 259. [2021-11-12 23:47:51,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 208 states have (on average 1.0769230769230769) internal successors, (224), 208 states have internal predecessors, (224), 19 states have call successors, (19), 12 states have call predecessors, (19), 31 states have return successors, (38), 38 states have call predecessors, (38), 18 states have call successors, (38) [2021-11-12 23:47:51,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 281 transitions. [2021-11-12 23:47:51,897 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 281 transitions. Word has length 272 [2021-11-12 23:47:51,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-12 23:47:51,898 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 281 transitions. [2021-11-12 23:47:51,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.3777777777777778) internal successors, (107), 45 states have internal predecessors, (107), 4 states have call successors, (5), 2 states have call predecessors, (5), 21 states have return successors, (21), 21 states have call predecessors, (21), 3 states have call successors, (21) [2021-11-12 23:47:51,899 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 281 transitions. [2021-11-12 23:47:51,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2021-11-12 23:47:51,901 INFO L506 BasicCegarLoop]: Found error trace [2021-11-12 23:47:51,901 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-12 23:47:51,947 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2021-11-12 23:47:52,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:47:52,119 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2021-11-12 23:47:52,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-12 23:47:52,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1884967196, now seen corresponding path program 16 times [2021-11-12 23:47:52,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-12 23:47:52,120 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421765421] [2021-11-12 23:47:52,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-12 23:47:52,120 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-12 23:47:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:47:56,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2584 backedges. 0 proven. 1234 refuted. 0 times theorem prover too weak. 1350 trivial. 0 not checked. [2021-11-12 23:47:56,253 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-12 23:47:56,253 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421765421] [2021-11-12 23:47:56,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421765421] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-12 23:47:56,254 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573653973] [2021-11-12 23:47:56,254 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-12 23:47:56,254 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-12 23:47:56,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 [2021-11-12 23:47:56,255 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-12 23:47:56,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39fc5b8b-f0a5-4e7a-bb8b-3317bf99a370/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-11-12 23:47:57,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-12 23:47:57,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 86 conjunts are in the unsatisfiable core [2021-11-12 23:47:57,661 INFO L286 TraceCheckSpWp]: Computing forward predicates...