./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/recursive/MultCommutative-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/MultCommutative-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ce29b37e076ab683230ebf17073db3b7759ea39570dd2ef64322b6d43bb636cd --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 03:51:29,566 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 03:51:29,569 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 03:51:29,626 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 03:51:29,626 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 03:51:29,631 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 03:51:29,633 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 03:51:29,639 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 03:51:29,642 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 03:51:29,644 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 03:51:29,645 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 03:51:29,647 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 03:51:29,648 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 03:51:29,656 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 03:51:29,657 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 03:51:29,659 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 03:51:29,661 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 03:51:29,664 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 03:51:29,665 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 03:51:29,670 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 03:51:29,674 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 03:51:29,675 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 03:51:29,679 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 03:51:29,680 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 03:51:29,686 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 03:51:29,686 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 03:51:29,687 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 03:51:29,689 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 03:51:29,689 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 03:51:29,690 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 03:51:29,691 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 03:51:29,692 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 03:51:29,694 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 03:51:29,695 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 03:51:29,698 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 03:51:29,699 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 03:51:29,699 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 03:51:29,700 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 03:51:29,701 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 03:51:29,702 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 03:51:29,703 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 03:51:29,703 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-03 03:51:29,735 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 03:51:29,735 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 03:51:29,735 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 03:51:29,736 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 03:51:29,736 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 03:51:29,736 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 03:51:29,737 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 03:51:29,737 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 03:51:29,737 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 03:51:29,737 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 03:51:29,738 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 03:51:29,738 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 03:51:29,739 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 03:51:29,740 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 03:51:29,740 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 03:51:29,740 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 03:51:29,740 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 03:51:29,740 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 03:51:29,741 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 03:51:29,741 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 03:51:29,742 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 03:51:29,742 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 03:51:29,742 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 03:51:29,744 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 03:51:29,744 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 03:51:29,745 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 03:51:29,745 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 03:51:29,745 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-03 03:51:29,746 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 03:51:29,746 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 03:51:29,747 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 03:51:29,747 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 03:51:29,747 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 03:51:29,747 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 03:51:29,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:51:29,748 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 03:51:29,749 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 03:51:29,749 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 03:51:29,749 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 03:51:29,750 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 03:51:29,750 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 03:51:29,750 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 03:51:29,750 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 03:51:29,750 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/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_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ce29b37e076ab683230ebf17073db3b7759ea39570dd2ef64322b6d43bb636cd [2022-11-03 03:51:30,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 03:51:30,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 03:51:30,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 03:51:30,074 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 03:51:30,074 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 03:51:30,076 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/recursive/MultCommutative-2.c [2022-11-03 03:51:30,147 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/data/1bb3c7ac7/ae227dc3fc7645dc89b166628d057f21/FLAGa23265baf [2022-11-03 03:51:30,584 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 03:51:30,584 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/sv-benchmarks/c/recursive/MultCommutative-2.c [2022-11-03 03:51:30,589 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/data/1bb3c7ac7/ae227dc3fc7645dc89b166628d057f21/FLAGa23265baf [2022-11-03 03:51:30,995 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/data/1bb3c7ac7/ae227dc3fc7645dc89b166628d057f21 [2022-11-03 03:51:30,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 03:51:30,999 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 03:51:31,000 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 03:51:31,001 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 03:51:31,004 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 03:51:31,005 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:51:30" (1/1) ... [2022-11-03 03:51:31,006 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60de6f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:31, skipping insertion in model container [2022-11-03 03:51:31,006 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:51:30" (1/1) ... [2022-11-03 03:51:31,013 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 03:51:31,025 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:51:31,195 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/sv-benchmarks/c/recursive/MultCommutative-2.c[970,983] [2022-11-03 03:51:31,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:51:31,204 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 03:51:31,220 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/sv-benchmarks/c/recursive/MultCommutative-2.c[970,983] [2022-11-03 03:51:31,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:51:31,233 INFO L208 MainTranslator]: Completed translation [2022-11-03 03:51:31,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:31 WrapperNode [2022-11-03 03:51:31,234 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 03:51:31,235 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 03:51:31,235 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 03:51:31,235 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 03:51:31,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:31" (1/1) ... [2022-11-03 03:51:31,250 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:31" (1/1) ... [2022-11-03 03:51:31,269 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2022-11-03 03:51:31,270 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 03:51:31,271 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 03:51:31,271 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 03:51:31,271 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 03:51:31,280 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:31" (1/1) ... [2022-11-03 03:51:31,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:31" (1/1) ... [2022-11-03 03:51:31,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:31" (1/1) ... [2022-11-03 03:51:31,290 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:31" (1/1) ... [2022-11-03 03:51:31,293 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:31" (1/1) ... [2022-11-03 03:51:31,294 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:31" (1/1) ... [2022-11-03 03:51:31,295 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:31" (1/1) ... [2022-11-03 03:51:31,296 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:31" (1/1) ... [2022-11-03 03:51:31,297 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 03:51:31,300 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 03:51:31,301 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 03:51:31,301 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 03:51:31,302 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:31" (1/1) ... [2022-11-03 03:51:31,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:51:31,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:51:31,343 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 03:51:31,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 03:51:31,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 03:51:31,380 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2022-11-03 03:51:31,381 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2022-11-03 03:51:31,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 03:51:31,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 03:51:31,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 03:51:31,438 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 03:51:31,439 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 03:51:31,663 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 03:51:31,706 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 03:51:31,706 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-03 03:51:31,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:51:31 BoogieIcfgContainer [2022-11-03 03:51:31,709 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 03:51:31,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 03:51:31,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 03:51:31,737 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 03:51:31,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:51:30" (1/3) ... [2022-11-03 03:51:31,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c8d73c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:51:31, skipping insertion in model container [2022-11-03 03:51:31,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:51:31" (2/3) ... [2022-11-03 03:51:31,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c8d73c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:51:31, skipping insertion in model container [2022-11-03 03:51:31,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:51:31" (3/3) ... [2022-11-03 03:51:31,740 INFO L112 eAbstractionObserver]: Analyzing ICFG MultCommutative-2.c [2022-11-03 03:51:31,763 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 03:51:31,763 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-11-03 03:51:31,856 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:51:31,865 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@34be547b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:51:31,865 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-03 03:51:31,869 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 24 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 03:51:31,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 03:51:31,877 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:31,878 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:51:31,878 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-03 03:51:31,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:31,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1027513993, now seen corresponding path program 1 times [2022-11-03 03:51:31,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:31,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882672856] [2022-11-03 03:51:31,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:31,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:32,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:51:32,139 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:32,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882672856] [2022-11-03 03:51:32,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882672856] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:51:32,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:51:32,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:51:32,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38344135] [2022-11-03 03:51:32,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:51:32,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:51:32,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:32,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:51:32,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:51:32,226 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 24 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:32,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:32,351 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2022-11-03 03:51:32,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:51:32,353 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-03 03:51:32,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:32,363 INFO L225 Difference]: With dead ends: 73 [2022-11-03 03:51:32,363 INFO L226 Difference]: Without dead ends: 42 [2022-11-03 03:51:32,366 INFO L412 NwaCegarLoop]: 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 [2022-11-03 03:51:32,370 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 39 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:32,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 63 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:51:32,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-03 03:51:32,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2022-11-03 03:51:32,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.44) internal successors, (36), 30 states have internal predecessors, (36), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 03:51:32,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2022-11-03 03:51:32,413 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 7 [2022-11-03 03:51:32,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:32,414 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2022-11-03 03:51:32,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:32,414 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2022-11-03 03:51:32,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 03:51:32,415 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:32,415 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:51:32,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 03:51:32,416 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-03 03:51:32,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:32,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1788169763, now seen corresponding path program 1 times [2022-11-03 03:51:32,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:32,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436774643] [2022-11-03 03:51:32,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:32,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:32,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:32,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:51:32,513 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:32,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436774643] [2022-11-03 03:51:32,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436774643] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:51:32,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:51:32,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:51:32,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801921659] [2022-11-03 03:51:32,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:51:32,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:51:32,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:32,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:51:32,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:51:32,520 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:32,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:32,670 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2022-11-03 03:51:32,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:51:32,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-03 03:51:32,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:32,674 INFO L225 Difference]: With dead ends: 58 [2022-11-03 03:51:32,674 INFO L226 Difference]: Without dead ends: 56 [2022-11-03 03:51:32,675 INFO L412 NwaCegarLoop]: 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 [2022-11-03 03:51:32,676 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 36 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:32,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 51 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:51:32,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-03 03:51:32,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2022-11-03 03:51:32,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 41 states have internal predecessors, (51), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 03:51:32,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2022-11-03 03:51:32,689 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 8 [2022-11-03 03:51:32,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:32,689 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2022-11-03 03:51:32,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:32,690 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2022-11-03 03:51:32,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 03:51:32,691 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:32,691 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:51:32,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 03:51:32,692 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-03 03:51:32,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:32,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1125158968, now seen corresponding path program 1 times [2022-11-03 03:51:32,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:32,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953111889] [2022-11-03 03:51:32,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:32,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:32,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:32,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:51:32,782 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:32,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953111889] [2022-11-03 03:51:32,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953111889] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:51:32,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:51:32,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:51:32,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132842186] [2022-11-03 03:51:32,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:51:32,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:51:32,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:32,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:51:32,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:51:32,785 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:32,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:32,871 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-11-03 03:51:32,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:51:32,872 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-03 03:51:32,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:32,874 INFO L225 Difference]: With dead ends: 76 [2022-11-03 03:51:32,874 INFO L226 Difference]: Without dead ends: 75 [2022-11-03 03:51:32,874 INFO L412 NwaCegarLoop]: 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 [2022-11-03 03:51:32,880 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 33 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:32,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 57 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:51:32,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-03 03:51:32,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2022-11-03 03:51:32,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 53 states have internal predecessors, (67), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-03 03:51:32,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2022-11-03 03:51:32,906 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 13 [2022-11-03 03:51:32,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:32,907 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2022-11-03 03:51:32,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:32,907 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2022-11-03 03:51:32,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 03:51:32,908 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:32,908 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:51:32,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 03:51:32,908 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-03 03:51:32,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:32,912 INFO L85 PathProgramCache]: Analyzing trace with hash -691954174, now seen corresponding path program 1 times [2022-11-03 03:51:32,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:32,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748377583] [2022-11-03 03:51:32,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:32,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:33,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:51:33,029 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:33,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748377583] [2022-11-03 03:51:33,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748377583] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:51:33,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:51:33,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:51:33,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679875994] [2022-11-03 03:51:33,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:51:33,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:51:33,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:33,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:51:33,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:51:33,036 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:51:33,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:33,142 INFO L93 Difference]: Finished difference Result 120 states and 154 transitions. [2022-11-03 03:51:33,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:51:33,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-11-03 03:51:33,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:33,147 INFO L225 Difference]: With dead ends: 120 [2022-11-03 03:51:33,148 INFO L226 Difference]: Without dead ends: 84 [2022-11-03 03:51:33,148 INFO L412 NwaCegarLoop]: 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 [2022-11-03 03:51:33,151 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 25 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:33,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 70 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:51:33,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-03 03:51:33,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2022-11-03 03:51:33,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 60 states have internal predecessors, (77), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-03 03:51:33,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2022-11-03 03:51:33,179 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 96 transitions. Word has length 14 [2022-11-03 03:51:33,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:33,180 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 96 transitions. [2022-11-03 03:51:33,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:51:33,181 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2022-11-03 03:51:33,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 03:51:33,181 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:33,182 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:51:33,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 03:51:33,182 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-03 03:51:33,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:33,183 INFO L85 PathProgramCache]: Analyzing trace with hash 24264138, now seen corresponding path program 1 times [2022-11-03 03:51:33,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:33,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837172631] [2022-11-03 03:51:33,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:33,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:33,262 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:51:33,262 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:33,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837172631] [2022-11-03 03:51:33,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837172631] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:51:33,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:51:33,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:51:33,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085872778] [2022-11-03 03:51:33,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:51:33,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:51:33,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:33,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:51:33,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:51:33,265 INFO L87 Difference]: Start difference. First operand 75 states and 96 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:51:33,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:33,358 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2022-11-03 03:51:33,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:51:33,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-11-03 03:51:33,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:33,363 INFO L225 Difference]: With dead ends: 101 [2022-11-03 03:51:33,366 INFO L226 Difference]: Without dead ends: 100 [2022-11-03 03:51:33,367 INFO L412 NwaCegarLoop]: 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 [2022-11-03 03:51:33,373 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 28 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:33,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 83 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:51:33,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-03 03:51:33,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 90. [2022-11-03 03:51:33,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 72 states have internal predecessors, (92), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-03 03:51:33,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 115 transitions. [2022-11-03 03:51:33,389 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 115 transitions. Word has length 15 [2022-11-03 03:51:33,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:33,390 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 115 transitions. [2022-11-03 03:51:33,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:51:33,390 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 115 transitions. [2022-11-03 03:51:33,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 03:51:33,391 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:33,391 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:51:33,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 03:51:33,391 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-03 03:51:33,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:33,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1116235770, now seen corresponding path program 1 times [2022-11-03 03:51:33,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:33,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877122747] [2022-11-03 03:51:33,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:33,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:33,458 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:51:33,459 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:33,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877122747] [2022-11-03 03:51:33,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877122747] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:51:33,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:51:33,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:51:33,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925070764] [2022-11-03 03:51:33,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:51:33,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:51:33,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:33,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:51:33,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:51:33,461 INFO L87 Difference]: Start difference. First operand 90 states and 115 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:33,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:33,514 INFO L93 Difference]: Finished difference Result 132 states and 168 transitions. [2022-11-03 03:51:33,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 03:51:33,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-03 03:51:33,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:33,517 INFO L225 Difference]: With dead ends: 132 [2022-11-03 03:51:33,517 INFO L226 Difference]: Without dead ends: 58 [2022-11-03 03:51:33,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:51:33,523 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 28 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:33,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 47 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 03:51:33,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-03 03:51:33,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2022-11-03 03:51:33,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 40 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-03 03:51:33,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2022-11-03 03:51:33,542 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 18 [2022-11-03 03:51:33,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:33,543 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2022-11-03 03:51:33,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:33,543 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2022-11-03 03:51:33,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 03:51:33,544 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:33,544 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:51:33,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 03:51:33,544 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-03 03:51:33,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:33,545 INFO L85 PathProgramCache]: Analyzing trace with hash 937076250, now seen corresponding path program 1 times [2022-11-03 03:51:33,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:33,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307246701] [2022-11-03 03:51:33,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:33,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:33,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:51:33,642 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:33,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307246701] [2022-11-03 03:51:33,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307246701] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:51:33,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595024554] [2022-11-03 03:51:33,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:33,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:51:33,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:51:33,646 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:51:33,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 03:51:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:33,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 03:51:33,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:51:33,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:51:33,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:51:33,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:51:33,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595024554] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:51:33,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1526616363] [2022-11-03 03:51:33,912 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 03:51:33,917 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:51:33,921 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-03 03:51:33,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:51:33,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-11-03 03:51:33,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3165285] [2022-11-03 03:51:33,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:51:33,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 03:51:33,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:33,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 03:51:33,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-11-03 03:51:33,930 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 03:51:34,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:34,089 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2022-11-03 03:51:34,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 03:51:34,090 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 17 [2022-11-03 03:51:34,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:34,091 INFO L225 Difference]: With dead ends: 66 [2022-11-03 03:51:34,091 INFO L226 Difference]: Without dead ends: 65 [2022-11-03 03:51:34,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-11-03 03:51:34,092 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 44 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:34,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 85 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:51:34,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-03 03:51:34,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2022-11-03 03:51:34,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-03 03:51:34,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2022-11-03 03:51:34,114 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 17 [2022-11-03 03:51:34,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:34,114 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-11-03 03:51:34,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 03:51:34,115 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-11-03 03:51:34,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 03:51:34,116 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:34,116 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:51:34,158 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 03:51:34,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:51:34,323 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-03 03:51:34,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:34,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1015407268, now seen corresponding path program 1 times [2022-11-03 03:51:34,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:34,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076801056] [2022-11-03 03:51:34,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:34,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:34,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:34,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:51:34,450 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:34,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076801056] [2022-11-03 03:51:34,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076801056] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:51:34,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077288460] [2022-11-03 03:51:34,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:34,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:51:34,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:51:34,459 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:51:34,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 03:51:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:34,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 03:51:34,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:51:34,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:51:34,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:51:34,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:51:34,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077288460] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:51:34,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [540979095] [2022-11-03 03:51:34,628 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-03 03:51:34,629 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:51:34,629 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-03 03:51:34,637 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:51:34,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2022-11-03 03:51:34,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667610601] [2022-11-03 03:51:34,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:51:34,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 03:51:34,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:34,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 03:51:34,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-03 03:51:34,639 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 03:51:34,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:34,732 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2022-11-03 03:51:34,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 03:51:34,733 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-11-03 03:51:34,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:34,733 INFO L225 Difference]: With dead ends: 64 [2022-11-03 03:51:34,733 INFO L226 Difference]: Without dead ends: 63 [2022-11-03 03:51:34,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-11-03 03:51:34,734 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 23 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:34,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 69 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 03:51:34,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-03 03:51:34,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2022-11-03 03:51:34,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-03 03:51:34,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2022-11-03 03:51:34,742 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 18 [2022-11-03 03:51:34,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:34,742 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2022-11-03 03:51:34,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 03:51:34,742 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2022-11-03 03:51:34,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 03:51:34,743 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:34,743 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:51:34,782 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 03:51:34,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:51:34,961 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-03 03:51:34,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:34,961 INFO L85 PathProgramCache]: Analyzing trace with hash -2063375789, now seen corresponding path program 1 times [2022-11-03 03:51:34,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:34,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861834361] [2022-11-03 03:51:34,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:34,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:35,085 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:51:35,087 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:35,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861834361] [2022-11-03 03:51:35,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861834361] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:51:35,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429119802] [2022-11-03 03:51:35,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:35,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:51:35,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:51:35,095 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:51:35,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 03:51:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:35,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 03:51:35,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:51:35,227 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:51:35,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:51:35,352 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:51:35,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429119802] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:51:35,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [28596089] [2022-11-03 03:51:35,355 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-03 03:51:35,356 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:51:35,356 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-03 03:51:35,357 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:51:35,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 11 [2022-11-03 03:51:35,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511454440] [2022-11-03 03:51:35,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:51:35,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 03:51:35,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:35,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 03:51:35,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-11-03 03:51:35,360 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 03:51:35,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:35,586 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2022-11-03 03:51:35,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 03:51:35,587 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-11-03 03:51:35,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:35,588 INFO L225 Difference]: With dead ends: 93 [2022-11-03 03:51:35,588 INFO L226 Difference]: Without dead ends: 92 [2022-11-03 03:51:35,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-11-03 03:51:35,591 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 35 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:35,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 75 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:51:35,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-03 03:51:35,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 79. [2022-11-03 03:51:35,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 62 states have internal predecessors, (72), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2022-11-03 03:51:35,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 91 transitions. [2022-11-03 03:51:35,615 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 91 transitions. Word has length 24 [2022-11-03 03:51:35,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:35,615 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 91 transitions. [2022-11-03 03:51:35,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 03:51:35,616 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2022-11-03 03:51:35,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 03:51:35,617 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:35,617 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:51:35,662 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 03:51:35,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:51:35,843 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-03 03:51:35,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:35,843 INFO L85 PathProgramCache]: Analyzing trace with hash 459860035, now seen corresponding path program 1 times [2022-11-03 03:51:35,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:35,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344345600] [2022-11-03 03:51:35,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:35,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:35,954 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 03:51:35,954 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:35,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344345600] [2022-11-03 03:51:35,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344345600] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:51:35,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611208724] [2022-11-03 03:51:35,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:35,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:51:35,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:51:35,956 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:51:35,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 03:51:36,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:36,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 03:51:36,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:51:36,069 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 03:51:36,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:51:36,121 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 03:51:36,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611208724] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:51:36,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1880202083] [2022-11-03 03:51:36,128 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-03 03:51:36,128 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:51:36,128 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-03 03:51:36,129 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:51:36,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2022-11-03 03:51:36,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073093728] [2022-11-03 03:51:36,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:51:36,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 03:51:36,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:36,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 03:51:36,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-03 03:51:36,133 INFO L87 Difference]: Start difference. First operand 79 states and 91 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 03:51:36,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:36,227 INFO L93 Difference]: Finished difference Result 96 states and 112 transitions. [2022-11-03 03:51:36,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 03:51:36,229 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-11-03 03:51:36,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:36,231 INFO L225 Difference]: With dead ends: 96 [2022-11-03 03:51:36,231 INFO L226 Difference]: Without dead ends: 63 [2022-11-03 03:51:36,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-11-03 03:51:36,232 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 24 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:36,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 119 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 03:51:36,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-03 03:51:36,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2022-11-03 03:51:36,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 42 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-03 03:51:36,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2022-11-03 03:51:36,247 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 25 [2022-11-03 03:51:36,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:36,248 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2022-11-03 03:51:36,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 03:51:36,248 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2022-11-03 03:51:36,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 03:51:36,254 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:36,254 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:51:36,292 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 03:51:36,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-03 03:51:36,470 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-03 03:51:36,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:36,471 INFO L85 PathProgramCache]: Analyzing trace with hash 385020750, now seen corresponding path program 1 times [2022-11-03 03:51:36,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:36,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093026137] [2022-11-03 03:51:36,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:36,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:36,686 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:51:36,686 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:36,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093026137] [2022-11-03 03:51:36,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093026137] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:51:36,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213220277] [2022-11-03 03:51:36,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:36,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:51:36,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:51:36,691 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:51:36,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 03:51:36,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:36,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 03:51:36,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:51:36,869 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:51:36,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:51:37,118 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:51:37,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213220277] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:51:37,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [162451207] [2022-11-03 03:51:37,121 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-03 03:51:37,121 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:51:37,122 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-03 03:51:37,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:51:37,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-11-03 03:51:37,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386477445] [2022-11-03 03:51:37,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:51:37,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 03:51:37,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:37,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 03:51:37,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2022-11-03 03:51:37,125 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-03 03:51:37,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:37,485 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2022-11-03 03:51:37,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-03 03:51:37,486 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2022-11-03 03:51:37,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:37,486 INFO L225 Difference]: With dead ends: 86 [2022-11-03 03:51:37,487 INFO L226 Difference]: Without dead ends: 85 [2022-11-03 03:51:37,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=807, Unknown=0, NotChecked=0, Total=992 [2022-11-03 03:51:37,488 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 60 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:37,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 124 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:51:37,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-03 03:51:37,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 64. [2022-11-03 03:51:37,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 50 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2022-11-03 03:51:37,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2022-11-03 03:51:37,494 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 28 [2022-11-03 03:51:37,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:37,495 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2022-11-03 03:51:37,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-03 03:51:37,495 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2022-11-03 03:51:37,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-03 03:51:37,496 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:37,496 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:51:37,531 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-03 03:51:37,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-03 03:51:37,718 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-03 03:51:37,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:37,719 INFO L85 PathProgramCache]: Analyzing trace with hash -377928031, now seen corresponding path program 1 times [2022-11-03 03:51:37,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:37,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898052761] [2022-11-03 03:51:37,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:37,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:37,902 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 03:51:37,902 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:37,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898052761] [2022-11-03 03:51:37,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898052761] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:51:37,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476915806] [2022-11-03 03:51:37,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:37,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:51:37,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:51:37,904 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:51:37,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 03:51:37,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:37,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 03:51:37,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:51:38,050 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 03:51:38,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:51:38,287 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 03:51:38,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476915806] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:51:38,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1035618256] [2022-11-03 03:51:38,295 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-03 03:51:38,295 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:51:38,296 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-03 03:51:38,297 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:51:38,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 18 [2022-11-03 03:51:38,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701794636] [2022-11-03 03:51:38,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:51:38,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-03 03:51:38,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:38,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-03 03:51:38,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-11-03 03:51:38,302 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand has 19 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 17 states have internal predecessors, (50), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-03 03:51:38,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:38,934 INFO L93 Difference]: Finished difference Result 128 states and 144 transitions. [2022-11-03 03:51:38,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-03 03:51:38,934 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 17 states have internal predecessors, (50), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 35 [2022-11-03 03:51:38,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:38,936 INFO L225 Difference]: With dead ends: 128 [2022-11-03 03:51:38,936 INFO L226 Difference]: Without dead ends: 123 [2022-11-03 03:51:38,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=332, Invalid=1150, Unknown=0, NotChecked=0, Total=1482 [2022-11-03 03:51:38,942 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 111 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:38,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 76 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:51:38,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-03 03:51:38,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 68. [2022-11-03 03:51:38,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 53 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (12), 10 states have call predecessors, (12), 5 states have call successors, (12) [2022-11-03 03:51:38,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2022-11-03 03:51:38,950 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 35 [2022-11-03 03:51:38,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:38,951 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2022-11-03 03:51:38,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 17 states have internal predecessors, (50), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-03 03:51:38,951 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2022-11-03 03:51:38,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-03 03:51:38,952 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:38,953 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2022-11-03 03:51:38,993 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 03:51:39,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:51:39,178 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-03 03:51:39,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:39,178 INFO L85 PathProgramCache]: Analyzing trace with hash 442028402, now seen corresponding path program 2 times [2022-11-03 03:51:39,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:39,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725573380] [2022-11-03 03:51:39,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:39,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:39,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:39,568 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-03 03:51:39,568 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:39,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725573380] [2022-11-03 03:51:39,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725573380] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:51:39,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060624322] [2022-11-03 03:51:39,569 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:51:39,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:51:39,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:51:39,575 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:51:39,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 03:51:39,659 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-11-03 03:51:39,659 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:51:39,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-03 03:51:39,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:51:39,921 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-03 03:51:39,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:51:40,989 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 10 proven. 96 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-03 03:51:40,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060624322] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:51:40,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [443137575] [2022-11-03 03:51:40,991 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-03 03:51:40,992 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:51:40,992 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-03 03:51:40,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:51:40,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 30 [2022-11-03 03:51:40,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396102030] [2022-11-03 03:51:40,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:51:40,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 03:51:40,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:40,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 03:51:40,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=802, Unknown=0, NotChecked=0, Total=930 [2022-11-03 03:51:40,996 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 31 states, 30 states have (on average 2.5) internal successors, (75), 29 states have internal predecessors, (75), 7 states have call successors, (9), 3 states have call predecessors, (9), 8 states have return successors, (12), 12 states have call predecessors, (12), 5 states have call successors, (12) [2022-11-03 03:51:41,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:41,821 INFO L93 Difference]: Finished difference Result 139 states and 161 transitions. [2022-11-03 03:51:41,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-03 03:51:41,822 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.5) internal successors, (75), 29 states have internal predecessors, (75), 7 states have call successors, (9), 3 states have call predecessors, (9), 8 states have return successors, (12), 12 states have call predecessors, (12), 5 states have call successors, (12) Word has length 62 [2022-11-03 03:51:41,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:41,823 INFO L225 Difference]: With dead ends: 139 [2022-11-03 03:51:41,823 INFO L226 Difference]: Without dead ends: 138 [2022-11-03 03:51:41,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 108 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=479, Invalid=2601, Unknown=0, NotChecked=0, Total=3080 [2022-11-03 03:51:41,825 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 174 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:41,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 115 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:51:41,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-11-03 03:51:41,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 88. [2022-11-03 03:51:41,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 70 states have (on average 1.0714285714285714) internal successors, (75), 69 states have internal predecessors, (75), 6 states have call successors, (6), 4 states have call predecessors, (6), 11 states have return successors, (20), 14 states have call predecessors, (20), 5 states have call successors, (20) [2022-11-03 03:51:41,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2022-11-03 03:51:41,834 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 62 [2022-11-03 03:51:41,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:41,836 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2022-11-03 03:51:41,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.5) internal successors, (75), 29 states have internal predecessors, (75), 7 states have call successors, (9), 3 states have call predecessors, (9), 8 states have return successors, (12), 12 states have call predecessors, (12), 5 states have call successors, (12) [2022-11-03 03:51:41,837 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2022-11-03 03:51:41,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-03 03:51:41,841 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:41,842 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:51:41,880 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 03:51:42,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-03 03:51:42,061 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-03 03:51:42,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:42,062 INFO L85 PathProgramCache]: Analyzing trace with hash -325154713, now seen corresponding path program 2 times [2022-11-03 03:51:42,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:42,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770340682] [2022-11-03 03:51:42,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:42,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:42,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:42,253 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 29 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-03 03:51:42,254 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:42,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770340682] [2022-11-03 03:51:42,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770340682] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:51:42,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598521032] [2022-11-03 03:51:42,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:51:42,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:51:42,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:51:42,256 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:51:42,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 03:51:42,316 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-03 03:51:42,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:51:42,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 03:51:42,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:51:42,403 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 29 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-03 03:51:42,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:51:42,651 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 29 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-03 03:51:42,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598521032] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:51:42,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1669358638] [2022-11-03 03:51:42,654 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-03 03:51:42,654 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:51:42,654 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-03 03:51:42,655 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:51:42,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-11-03 03:51:42,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191820401] [2022-11-03 03:51:42,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:51:42,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 03:51:42,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:42,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 03:51:42,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2022-11-03 03:51:42,656 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand has 20 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 7 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2022-11-03 03:51:42,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:42,965 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2022-11-03 03:51:42,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-03 03:51:42,966 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 7 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) Word has length 46 [2022-11-03 03:51:42,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:42,967 INFO L225 Difference]: With dead ends: 109 [2022-11-03 03:51:42,967 INFO L226 Difference]: Without dead ends: 104 [2022-11-03 03:51:42,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=177, Invalid=753, Unknown=0, NotChecked=0, Total=930 [2022-11-03 03:51:42,968 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 86 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:42,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 123 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:51:42,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-03 03:51:42,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2022-11-03 03:51:42,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 78 states have (on average 1.064102564102564) internal successors, (83), 77 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 13 states have return successors, (22), 16 states have call predecessors, (22), 5 states have call successors, (22) [2022-11-03 03:51:42,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2022-11-03 03:51:42,980 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 46 [2022-11-03 03:51:42,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:42,981 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2022-11-03 03:51:42,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 7 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2022-11-03 03:51:42,982 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2022-11-03 03:51:42,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-03 03:51:42,985 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:42,985 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 5, 5, 5, 5, 5, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:51:43,021 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 03:51:43,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-03 03:51:43,211 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-03 03:51:43,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:43,211 INFO L85 PathProgramCache]: Analyzing trace with hash -674862935, now seen corresponding path program 3 times [2022-11-03 03:51:43,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:43,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052182596] [2022-11-03 03:51:43,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:43,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:43,532 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 115 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-03 03:51:43,532 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:43,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052182596] [2022-11-03 03:51:43,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052182596] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:51:43,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652401815] [2022-11-03 03:51:43,533 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:51:43,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:51:43,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:51:43,534 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:51:43,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 03:51:43,600 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:51:43,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:51:43,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-03 03:51:43,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:51:43,829 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 115 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-03 03:51:43,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:51:44,972 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 12 proven. 117 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-03 03:51:44,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652401815] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:51:44,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1229678850] [2022-11-03 03:51:44,976 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-03 03:51:44,976 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:51:44,976 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-03 03:51:44,977 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:51:44,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 18] total 36 [2022-11-03 03:51:44,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945556581] [2022-11-03 03:51:44,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:51:44,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-03 03:51:44,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:44,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-03 03:51:44,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1183, Unknown=0, NotChecked=0, Total=1332 [2022-11-03 03:51:44,980 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand has 37 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 35 states have internal predecessors, (98), 10 states have call successors, (10), 3 states have call predecessors, (10), 11 states have return successors, (16), 16 states have call predecessors, (16), 8 states have call successors, (16) [2022-11-03 03:51:46,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:46,672 INFO L93 Difference]: Finished difference Result 187 states and 209 transitions. [2022-11-03 03:51:46,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-03 03:51:46,673 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 35 states have internal predecessors, (98), 10 states have call successors, (10), 3 states have call predecessors, (10), 11 states have return successors, (16), 16 states have call predecessors, (16), 8 states have call successors, (16) Word has length 68 [2022-11-03 03:51:46,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:46,674 INFO L225 Difference]: With dead ends: 187 [2022-11-03 03:51:46,675 INFO L226 Difference]: Without dead ends: 176 [2022-11-03 03:51:46,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 119 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1289 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=924, Invalid=5082, Unknown=0, NotChecked=0, Total=6006 [2022-11-03 03:51:46,679 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 197 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:46,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 183 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 03:51:46,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-11-03 03:51:46,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 161. [2022-11-03 03:51:46,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 128 states have (on average 1.0546875) internal successors, (135), 127 states have internal predecessors, (135), 9 states have call successors, (9), 6 states have call predecessors, (9), 23 states have return successors, (33), 27 states have call predecessors, (33), 7 states have call successors, (33) [2022-11-03 03:51:46,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 177 transitions. [2022-11-03 03:51:46,689 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 177 transitions. Word has length 68 [2022-11-03 03:51:46,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:46,690 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 177 transitions. [2022-11-03 03:51:46,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 35 states have internal predecessors, (98), 10 states have call successors, (10), 3 states have call predecessors, (10), 11 states have return successors, (16), 16 states have call predecessors, (16), 8 states have call successors, (16) [2022-11-03 03:51:46,690 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 177 transitions. [2022-11-03 03:51:46,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-11-03 03:51:46,691 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:46,691 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1] [2022-11-03 03:51:46,730 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-03 03:51:46,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-03 03:51:46,910 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-03 03:51:46,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:46,911 INFO L85 PathProgramCache]: Analyzing trace with hash 147099220, now seen corresponding path program 3 times [2022-11-03 03:51:46,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:46,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543790103] [2022-11-03 03:51:46,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:46,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:47,583 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2022-11-03 03:51:47,583 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:47,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543790103] [2022-11-03 03:51:47,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543790103] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:51:47,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314210682] [2022-11-03 03:51:47,583 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:51:47,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:51:47,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:51:47,585 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:51:47,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 03:51:47,676 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:51:47,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:51:47,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-03 03:51:47,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:51:48,236 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2022-11-03 03:51:48,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:51:52,969 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 30 proven. 192 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-11-03 03:51:52,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314210682] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:51:52,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1658531171] [2022-11-03 03:51:52,972 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-03 03:51:52,972 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:51:52,972 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-03 03:51:52,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:51:52,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 22] total 50 [2022-11-03 03:51:52,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857621913] [2022-11-03 03:51:52,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:51:52,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-03 03:51:52,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:52,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-03 03:51:52,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=2248, Unknown=0, NotChecked=0, Total=2550 [2022-11-03 03:51:52,977 INFO L87 Difference]: Start difference. First operand 161 states and 177 transitions. Second operand has 51 states, 50 states have (on average 2.38) internal successors, (119), 49 states have internal predecessors, (119), 7 states have call successors, (7), 3 states have call predecessors, (7), 16 states have return successors, (24), 24 states have call predecessors, (24), 5 states have call successors, (24) [2022-11-03 03:51:55,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:55,099 INFO L93 Difference]: Finished difference Result 298 states and 341 transitions. [2022-11-03 03:51:55,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-11-03 03:51:55,100 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.38) internal successors, (119), 49 states have internal predecessors, (119), 7 states have call successors, (7), 3 states have call predecessors, (7), 16 states have return successors, (24), 24 states have call predecessors, (24), 5 states have call successors, (24) Word has length 94 [2022-11-03 03:51:55,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:55,102 INFO L225 Difference]: With dead ends: 298 [2022-11-03 03:51:55,102 INFO L226 Difference]: Without dead ends: 297 [2022-11-03 03:51:55,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 158 SyntacticMatches, 7 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2663 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1256, Invalid=8844, Unknown=0, NotChecked=0, Total=10100 [2022-11-03 03:51:55,106 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 366 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 1185 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 1185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:55,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 343 Invalid, 1447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 1185 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-03 03:51:55,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-11-03 03:51:55,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 201. [2022-11-03 03:51:55,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 160 states have (on average 1.04375) internal successors, (167), 159 states have internal predecessors, (167), 9 states have call successors, (9), 6 states have call predecessors, (9), 31 states have return successors, (49), 35 states have call predecessors, (49), 7 states have call successors, (49) [2022-11-03 03:51:55,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 225 transitions. [2022-11-03 03:51:55,120 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 225 transitions. Word has length 94 [2022-11-03 03:51:55,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:55,120 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 225 transitions. [2022-11-03 03:51:55,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.38) internal successors, (119), 49 states have internal predecessors, (119), 7 states have call successors, (7), 3 states have call predecessors, (7), 16 states have return successors, (24), 24 states have call predecessors, (24), 5 states have call successors, (24) [2022-11-03 03:51:55,121 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 225 transitions. [2022-11-03 03:51:55,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-03 03:51:55,122 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:55,122 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 7, 7, 7, 7, 7, 7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:51:55,154 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 03:51:55,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:51:55,338 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-03 03:51:55,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:55,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1830791249, now seen corresponding path program 4 times [2022-11-03 03:51:55,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:55,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847542951] [2022-11-03 03:51:55,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:55,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:55,718 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 121 proven. 81 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-11-03 03:51:55,718 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:55,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847542951] [2022-11-03 03:51:55,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847542951] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:51:55,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714384564] [2022-11-03 03:51:55,719 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:51:55,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:51:55,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:51:55,723 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:51:55,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 03:51:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:55,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-03 03:51:55,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:51:56,300 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 3 proven. 214 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-11-03 03:51:56,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:51:58,079 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 8 proven. 243 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-03 03:51:58,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714384564] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:51:58,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1068571825] [2022-11-03 03:51:58,082 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-03 03:51:58,082 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:51:58,082 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-03 03:51:58,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:51:58,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 23] total 47 [2022-11-03 03:51:58,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34391756] [2022-11-03 03:51:58,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:51:58,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-03 03:51:58,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:58,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-03 03:51:58,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=2032, Unknown=0, NotChecked=0, Total=2256 [2022-11-03 03:51:58,086 INFO L87 Difference]: Start difference. First operand 201 states and 225 transitions. Second operand has 48 states, 47 states have (on average 2.9361702127659575) internal successors, (138), 45 states have internal predecessors, (138), 14 states have call successors, (16), 4 states have call predecessors, (16), 15 states have return successors, (23), 22 states have call predecessors, (23), 12 states have call successors, (23) [2022-11-03 03:52:00,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:52:00,544 INFO L93 Difference]: Finished difference Result 340 states and 387 transitions. [2022-11-03 03:52:00,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-11-03 03:52:00,551 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.9361702127659575) internal successors, (138), 45 states have internal predecessors, (138), 14 states have call successors, (16), 4 states have call predecessors, (16), 15 states have return successors, (23), 22 states have call predecessors, (23), 12 states have call successors, (23) Word has length 90 [2022-11-03 03:52:00,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:52:00,558 INFO L225 Difference]: With dead ends: 340 [2022-11-03 03:52:00,558 INFO L226 Difference]: Without dead ends: 319 [2022-11-03 03:52:00,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 150 SyntacticMatches, 4 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2737 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1684, Invalid=9446, Unknown=0, NotChecked=0, Total=11130 [2022-11-03 03:52:00,562 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 308 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 1357 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 1623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 1357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 03:52:00,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 301 Invalid, 1623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 1357 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-03 03:52:00,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-11-03 03:52:00,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 168. [2022-11-03 03:52:00,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 134 states have (on average 1.037313432835821) internal successors, (139), 133 states have internal predecessors, (139), 6 states have call successors, (6), 4 states have call predecessors, (6), 27 states have return successors, (44), 30 states have call predecessors, (44), 5 states have call successors, (44) [2022-11-03 03:52:00,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 189 transitions. [2022-11-03 03:52:00,589 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 189 transitions. Word has length 90 [2022-11-03 03:52:00,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:52:00,591 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 189 transitions. [2022-11-03 03:52:00,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.9361702127659575) internal successors, (138), 45 states have internal predecessors, (138), 14 states have call successors, (16), 4 states have call predecessors, (16), 15 states have return successors, (23), 22 states have call predecessors, (23), 12 states have call successors, (23) [2022-11-03 03:52:00,591 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 189 transitions. [2022-11-03 03:52:00,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-11-03 03:52:00,598 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:52:00,599 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 11, 11, 11, 11, 11, 11, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:52:00,638 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-03 03:52:00,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-03 03:52:00,815 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-03 03:52:00,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:52:00,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1988880751, now seen corresponding path program 5 times [2022-11-03 03:52:00,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:52:00,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162672847] [2022-11-03 03:52:00,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:52:00,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:52:00,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:52:01,805 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 2 proven. 436 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2022-11-03 03:52:01,805 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:52:01,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162672847] [2022-11-03 03:52:01,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162672847] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:52:01,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487375305] [2022-11-03 03:52:01,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:52:01,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:52:01,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:52:01,807 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:52:01,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 03:52:01,973 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-11-03 03:52:01,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:52:01,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 85 conjunts are in the unsatisfiable core [2022-11-03 03:52:01,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:52:02,992 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 42 proven. 434 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-11-03 03:52:02,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:52:05,494 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 77 proven. 436 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2022-11-03 03:52:05,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487375305] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:52:05,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1586524929] [2022-11-03 03:52:05,496 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-03 03:52:05,497 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:52:05,497 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-03 03:52:05,498 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:52:05,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29, 31] total 65 [2022-11-03 03:52:05,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151485832] [2022-11-03 03:52:05,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:52:05,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-03 03:52:05,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:52:05,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-03 03:52:05,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=4042, Unknown=0, NotChecked=0, Total=4290 [2022-11-03 03:52:05,501 INFO L87 Difference]: Start difference. First operand 168 states and 189 transitions. Second operand has 66 states, 65 states have (on average 2.4153846153846152) internal successors, (157), 63 states have internal predecessors, (157), 8 states have call successors, (9), 2 states have call predecessors, (9), 23 states have return successors, (33), 32 states have call predecessors, (33), 7 states have call successors, (33) [2022-11-03 03:52:09,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:52:09,645 INFO L93 Difference]: Finished difference Result 316 states and 347 transitions. [2022-11-03 03:52:09,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-11-03 03:52:09,646 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 2.4153846153846152) internal successors, (157), 63 states have internal predecessors, (157), 8 states have call successors, (9), 2 states have call predecessors, (9), 23 states have return successors, (33), 32 states have call predecessors, (33), 7 states have call successors, (33) Word has length 134 [2022-11-03 03:52:09,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:52:09,647 INFO L225 Difference]: With dead ends: 316 [2022-11-03 03:52:09,648 INFO L226 Difference]: Without dead ends: 309 [2022-11-03 03:52:09,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 229 SyntacticMatches, 12 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4156 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1374, Invalid=14628, Unknown=0, NotChecked=0, Total=16002 [2022-11-03 03:52:09,652 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 326 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 3760 mSolverCounterSat, 309 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 4069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 309 IncrementalHoareTripleChecker+Valid, 3760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:52:09,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 885 Invalid, 4069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [309 Valid, 3760 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-03 03:52:09,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-11-03 03:52:09,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 251. [2022-11-03 03:52:09,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 200 states have (on average 1.035) internal successors, (207), 199 states have internal predecessors, (207), 9 states have call successors, (9), 6 states have call predecessors, (9), 41 states have return successors, (59), 45 states have call predecessors, (59), 7 states have call successors, (59) [2022-11-03 03:52:09,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 275 transitions. [2022-11-03 03:52:09,677 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 275 transitions. Word has length 134 [2022-11-03 03:52:09,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:52:09,677 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 275 transitions. [2022-11-03 03:52:09,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 2.4153846153846152) internal successors, (157), 63 states have internal predecessors, (157), 8 states have call successors, (9), 2 states have call predecessors, (9), 23 states have return successors, (33), 32 states have call predecessors, (33), 7 states have call successors, (33) [2022-11-03 03:52:09,678 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 275 transitions. [2022-11-03 03:52:09,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-11-03 03:52:09,680 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:52:09,680 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 12, 12, 12, 12, 12, 12, 11, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:52:09,720 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-03 03:52:09,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-03 03:52:09,902 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-03 03:52:09,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:52:09,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1545540795, now seen corresponding path program 6 times [2022-11-03 03:52:09,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:52:09,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333720871] [2022-11-03 03:52:09,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:52:09,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:52:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:52:10,821 INFO L134 CoverageAnalysis]: Checked inductivity of 814 backedges. 241 proven. 291 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2022-11-03 03:52:10,821 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:52:10,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333720871] [2022-11-03 03:52:10,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333720871] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:52:10,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116944848] [2022-11-03 03:52:10,822 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:52:10,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:52:10,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:52:10,827 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:52:10,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-03 03:52:11,006 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:52:11,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:52:11,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-03 03:52:11,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:52:11,836 INFO L134 CoverageAnalysis]: Checked inductivity of 814 backedges. 3 proven. 544 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2022-11-03 03:52:11,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:52:20,738 INFO L134 CoverageAnalysis]: Checked inductivity of 814 backedges. 33 proven. 623 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2022-11-03 03:52:20,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116944848] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:52:20,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1072783962] [2022-11-03 03:52:20,742 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-03 03:52:20,742 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:52:20,743 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-03 03:52:20,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:52:20,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 29, 33] total 72 [2022-11-03 03:52:20,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73594278] [2022-11-03 03:52:20,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:52:20,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-11-03 03:52:20,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:52:20,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-11-03 03:52:20,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=484, Invalid=4772, Unknown=0, NotChecked=0, Total=5256 [2022-11-03 03:52:20,753 INFO L87 Difference]: Start difference. First operand 251 states and 275 transitions. Second operand has 73 states, 72 states have (on average 2.6805555555555554) internal successors, (193), 70 states have internal predecessors, (193), 14 states have call successors, (16), 4 states have call predecessors, (16), 25 states have return successors, (38), 37 states have call predecessors, (38), 12 states have call successors, (38) [2022-11-03 03:52:26,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:52:26,777 INFO L93 Difference]: Finished difference Result 535 states and 612 transitions. [2022-11-03 03:52:26,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2022-11-03 03:52:26,778 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 72 states have (on average 2.6805555555555554) internal successors, (193), 70 states have internal predecessors, (193), 14 states have call successors, (16), 4 states have call predecessors, (16), 25 states have return successors, (38), 37 states have call predecessors, (38), 12 states have call successors, (38) Word has length 145 [2022-11-03 03:52:26,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:52:26,781 INFO L225 Difference]: With dead ends: 535 [2022-11-03 03:52:26,781 INFO L226 Difference]: Without dead ends: 494 [2022-11-03 03:52:26,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 245 SyntacticMatches, 9 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12297 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=4429, Invalid=35771, Unknown=0, NotChecked=0, Total=40200 [2022-11-03 03:52:26,788 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 816 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 2396 mSolverCounterSat, 744 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 3140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 744 IncrementalHoareTripleChecker+Valid, 2396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:52:26,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 376 Invalid, 3140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [744 Valid, 2396 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-03 03:52:26,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2022-11-03 03:52:26,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 218. [2022-11-03 03:52:26,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 174 states have (on average 1.028735632183908) internal successors, (179), 173 states have internal predecessors, (179), 6 states have call successors, (6), 4 states have call predecessors, (6), 37 states have return successors, (54), 40 states have call predecessors, (54), 5 states have call successors, (54) [2022-11-03 03:52:26,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 239 transitions. [2022-11-03 03:52:26,806 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 239 transitions. Word has length 145 [2022-11-03 03:52:26,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:52:26,807 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 239 transitions. [2022-11-03 03:52:26,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 72 states have (on average 2.6805555555555554) internal successors, (193), 70 states have internal predecessors, (193), 14 states have call successors, (16), 4 states have call predecessors, (16), 25 states have return successors, (38), 37 states have call predecessors, (38), 12 states have call successors, (38) [2022-11-03 03:52:26,808 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 239 transitions. [2022-11-03 03:52:26,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-11-03 03:52:26,811 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:52:26,811 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 16, 16, 16, 15, 15, 1, 1, 1, 1, 1, 1] [2022-11-03 03:52:26,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-03 03:52:27,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:52:27,026 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-03 03:52:27,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:52:27,027 INFO L85 PathProgramCache]: Analyzing trace with hash 106899070, now seen corresponding path program 4 times [2022-11-03 03:52:27,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:52:27,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239244473] [2022-11-03 03:52:27,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:52:27,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:52:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:52:28,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1557 backedges. 0 proven. 894 refuted. 0 times theorem prover too weak. 663 trivial. 0 not checked. [2022-11-03 03:52:28,901 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:52:28,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239244473] [2022-11-03 03:52:28,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239244473] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:52:28,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172050756] [2022-11-03 03:52:28,903 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:52:28,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:52:28,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:52:28,904 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:52:28,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-03 03:52:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:52:29,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-03 03:52:29,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:52:30,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1557 backedges. 0 proven. 894 refuted. 0 times theorem prover too weak. 663 trivial. 0 not checked. [2022-11-03 03:52:30,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:53:06,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1557 backedges. 70 proven. 894 refuted. 0 times theorem prover too weak. 593 trivial. 0 not checked. [2022-11-03 03:53:06,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172050756] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:53:06,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1126941633] [2022-11-03 03:53:06,251 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-03 03:53:06,252 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:53:06,252 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-03 03:53:06,252 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:53:06,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 38] total 90 [2022-11-03 03:53:06,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67896695] [2022-11-03 03:53:06,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:53:06,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2022-11-03 03:53:06,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:53:06,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2022-11-03 03:53:06,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=890, Invalid=7300, Unknown=0, NotChecked=0, Total=8190 [2022-11-03 03:53:06,255 INFO L87 Difference]: Start difference. First operand 218 states and 239 transitions. Second operand has 91 states, 90 states have (on average 2.3) internal successors, (207), 89 states have internal predecessors, (207), 7 states have call successors, (9), 3 states have call predecessors, (9), 32 states have return successors, (48), 48 states have call predecessors, (48), 5 states have call successors, (48) [2022-11-03 03:53:11,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:53:11,357 INFO L93 Difference]: Finished difference Result 450 states and 517 transitions. [2022-11-03 03:53:11,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2022-11-03 03:53:11,358 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 90 states have (on average 2.3) internal successors, (207), 89 states have internal predecessors, (207), 7 states have call successors, (9), 3 states have call predecessors, (9), 32 states have return successors, (48), 48 states have call predecessors, (48), 5 states have call successors, (48) Word has length 194 [2022-11-03 03:53:11,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:53:11,360 INFO L225 Difference]: With dead ends: 450 [2022-11-03 03:53:11,361 INFO L226 Difference]: Without dead ends: 449 [2022-11-03 03:53:11,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 336 SyntacticMatches, 17 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10480 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=3564, Invalid=30846, Unknown=0, NotChecked=0, Total=34410 [2022-11-03 03:53:11,375 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 734 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 2776 mSolverCounterSat, 511 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 3287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 511 IncrementalHoareTripleChecker+Valid, 2776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:53:11,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [782 Valid, 608 Invalid, 3287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [511 Valid, 2776 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-03 03:53:11,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2022-11-03 03:53:11,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 298. [2022-11-03 03:53:11,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 238 states have (on average 1.0210084033613445) internal successors, (243), 237 states have internal predecessors, (243), 6 states have call successors, (6), 4 states have call predecessors, (6), 53 states have return successors, (86), 56 states have call predecessors, (86), 5 states have call successors, (86) [2022-11-03 03:53:11,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 335 transitions. [2022-11-03 03:53:11,406 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 335 transitions. Word has length 194 [2022-11-03 03:53:11,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:53:11,407 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 335 transitions. [2022-11-03 03:53:11,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 90 states have (on average 2.3) internal successors, (207), 89 states have internal predecessors, (207), 7 states have call successors, (9), 3 states have call predecessors, (9), 32 states have return successors, (48), 48 states have call predecessors, (48), 5 states have call successors, (48) [2022-11-03 03:53:11,408 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 335 transitions. [2022-11-03 03:53:11,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-11-03 03:53:11,413 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:53:11,413 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 21, 21, 21, 21, 21, 21, 20, 20, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:53:11,444 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-03 03:53:11,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:53:11,634 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-03 03:53:11,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:53:11,635 INFO L85 PathProgramCache]: Analyzing trace with hash -2053363015, now seen corresponding path program 7 times [2022-11-03 03:53:11,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:53:11,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707141006] [2022-11-03 03:53:11,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:53:11,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:53:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:53:14,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2461 backedges. 2 proven. 1371 refuted. 0 times theorem prover too weak. 1088 trivial. 0 not checked. [2022-11-03 03:53:14,407 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:53:14,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707141006] [2022-11-03 03:53:14,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707141006] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:53:14,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222791776] [2022-11-03 03:53:14,408 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:53:14,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:53:14,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:53:14,409 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:53:14,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-03 03:53:15,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:53:15,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 86 conjunts are in the unsatisfiable core [2022-11-03 03:53:15,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:53:16,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2461 backedges. 2 proven. 1371 refuted. 0 times theorem prover too weak. 1088 trivial. 0 not checked. [2022-11-03 03:53:16,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:54:32,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2461 backedges. 32 proven. 1793 refuted. 0 times theorem prover too weak. 636 trivial. 0 not checked. [2022-11-03 03:54:32,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222791776] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:54:32,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [46830210] [2022-11-03 03:54:32,866 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-03 03:54:32,866 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:54:32,866 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-03 03:54:32,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:54:32,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 51] total 117 [2022-11-03 03:54:32,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053621786] [2022-11-03 03:54:32,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:54:32,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 118 states [2022-11-03 03:54:32,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:32,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2022-11-03 03:54:32,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1352, Invalid=12454, Unknown=0, NotChecked=0, Total=13806 [2022-11-03 03:54:32,871 INFO L87 Difference]: Start difference. First operand 298 states and 335 transitions. Second operand has 118 states, 117 states have (on average 2.3846153846153846) internal successors, (279), 116 states have internal predecessors, (279), 11 states have call successors, (11), 3 states have call predecessors, (11), 43 states have return successors, (64), 64 states have call predecessors, (64), 9 states have call successors, (64) [2022-11-03 03:54:48,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:48,012 INFO L93 Difference]: Finished difference Result 659 states and 737 transitions. [2022-11-03 03:54:48,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 240 states. [2022-11-03 03:54:48,014 INFO L78 Accepts]: Start accepts. Automaton has has 118 states, 117 states have (on average 2.3846153846153846) internal successors, (279), 116 states have internal predecessors, (279), 11 states have call successors, (11), 3 states have call predecessors, (11), 43 states have return successors, (64), 64 states have call predecessors, (64), 9 states have call successors, (64) Word has length 244 [2022-11-03 03:54:48,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:48,017 INFO L225 Difference]: With dead ends: 659 [2022-11-03 03:54:48,017 INFO L226 Difference]: Without dead ends: 616 [2022-11-03 03:54:48,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 790 GetRequests, 423 SyntacticMatches, 18 SemanticMatches, 349 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41409 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=8952, Invalid=113898, Unknown=0, NotChecked=0, Total=122850 [2022-11-03 03:54:48,024 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 728 mSDsluCounter, 1569 mSDsCounter, 0 mSdLazyCounter, 9238 mSolverCounterSat, 762 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1613 SdHoareTripleChecker+Invalid, 10000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 762 IncrementalHoareTripleChecker+Valid, 9238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:48,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1613 Invalid, 10000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [762 Valid, 9238 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-11-03 03:54:48,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2022-11-03 03:54:48,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 521. [2022-11-03 03:54:48,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 416 states have (on average 1.0168269230769231) internal successors, (423), 415 states have internal predecessors, (423), 9 states have call successors, (9), 6 states have call predecessors, (9), 95 states have return successors, (129), 99 states have call predecessors, (129), 7 states have call successors, (129) [2022-11-03 03:54:48,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 561 transitions. [2022-11-03 03:54:48,047 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 561 transitions. Word has length 244 [2022-11-03 03:54:48,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:48,048 INFO L495 AbstractCegarLoop]: Abstraction has 521 states and 561 transitions. [2022-11-03 03:54:48,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 118 states, 117 states have (on average 2.3846153846153846) internal successors, (279), 116 states have internal predecessors, (279), 11 states have call successors, (11), 3 states have call predecessors, (11), 43 states have return successors, (64), 64 states have call predecessors, (64), 9 states have call successors, (64) [2022-11-03 03:54:48,048 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 561 transitions. [2022-11-03 03:54:48,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2022-11-03 03:54:48,053 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:48,053 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 25, 25, 25, 25, 24, 23, 23, 22, 22, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:54:48,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-03 03:54:48,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-03 03:54:48,274 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-03 03:54:48,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:48,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1370498209, now seen corresponding path program 8 times [2022-11-03 03:54:48,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:48,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803822558] [2022-11-03 03:54:48,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:48,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:51,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3242 backedges. 535 proven. 1439 refuted. 0 times theorem prover too weak. 1268 trivial. 0 not checked. [2022-11-03 03:54:51,277 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:51,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803822558] [2022-11-03 03:54:51,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803822558] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:54:51,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849536442] [2022-11-03 03:54:51,278 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:54:51,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:54:51,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:54:51,279 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:54:51,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-03 03:54:52,692 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2022-11-03 03:54:52,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:54:52,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 96 conjunts are in the unsatisfiable core [2022-11-03 03:54:52,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:54:54,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3242 backedges. 9 proven. 1980 refuted. 0 times theorem prover too weak. 1253 trivial. 0 not checked. [2022-11-03 03:54:54,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:56:26,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3242 backedges. 9 proven. 2084 refuted. 0 times theorem prover too weak. 1149 trivial. 0 not checked. [2022-11-03 03:56:26,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849536442] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:56:26,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [373349194] [2022-11-03 03:56:26,288 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-03 03:56:26,288 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:56:26,289 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-03 03:56:26,291 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:56:26,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 51, 54] total 126 [2022-11-03 03:56:26,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657048387] [2022-11-03 03:56:26,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:56:26,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 127 states [2022-11-03 03:56:26,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:56:26,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2022-11-03 03:56:26,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1467, Invalid=14535, Unknown=0, NotChecked=0, Total=16002 [2022-11-03 03:56:26,296 INFO L87 Difference]: Start difference. First operand 521 states and 561 transitions. Second operand has 127 states, 126 states have (on average 2.4523809523809526) internal successors, (309), 124 states have internal predecessors, (309), 13 states have call successors, (18), 4 states have call predecessors, (18), 47 states have return successors, (71), 70 states have call predecessors, (71), 11 states have call successors, (71) [2022-11-03 03:56:46,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:56:46,932 INFO L93 Difference]: Finished difference Result 1044 states and 1171 transitions. [2022-11-03 03:56:46,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 289 states. [2022-11-03 03:56:46,936 INFO L78 Accepts]: Start accepts. Automaton has has 127 states, 126 states have (on average 2.4523809523809526) internal successors, (309), 124 states have internal predecessors, (309), 13 states have call successors, (18), 4 states have call predecessors, (18), 47 states have return successors, (71), 70 states have call predecessors, (71), 11 states have call successors, (71) Word has length 278 [2022-11-03 03:56:46,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:56:46,940 INFO L225 Difference]: With dead ends: 1044 [2022-11-03 03:56:46,940 INFO L226 Difference]: Without dead ends: 959 [2022-11-03 03:56:46,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 910 GetRequests, 480 SyntacticMatches, 23 SemanticMatches, 407 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58169 ImplicationChecksByTransitivity, 21.3s TimeCoverageRelationStatistics Valid=13765, Invalid=153107, Unknown=0, NotChecked=0, Total=166872 [2022-11-03 03:56:46,953 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 1815 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 10443 mSolverCounterSat, 1791 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1815 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 12234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1791 IncrementalHoareTripleChecker+Valid, 10443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:56:46,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1815 Valid, 1322 Invalid, 12234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1791 Valid, 10443 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-11-03 03:56:46,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2022-11-03 03:56:46,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 408. [2022-11-03 03:56:46,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 326 states have (on average 1.0153374233128833) internal successors, (331), 325 states have internal predecessors, (331), 6 states have call successors, (6), 4 states have call predecessors, (6), 75 states have return successors, (108), 78 states have call predecessors, (108), 5 states have call successors, (108) [2022-11-03 03:56:46,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 445 transitions. [2022-11-03 03:56:46,974 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 445 transitions. Word has length 278 [2022-11-03 03:56:46,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:56:46,975 INFO L495 AbstractCegarLoop]: Abstraction has 408 states and 445 transitions. [2022-11-03 03:56:46,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 127 states, 126 states have (on average 2.4523809523809526) internal successors, (309), 124 states have internal predecessors, (309), 13 states have call successors, (18), 4 states have call predecessors, (18), 47 states have return successors, (71), 70 states have call predecessors, (71), 11 states have call successors, (71) [2022-11-03 03:56:46,976 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 445 transitions. [2022-11-03 03:56:46,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2022-11-03 03:56:46,982 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:56:46,983 INFO L195 NwaCegarLoop]: trace histogram [35, 35, 34, 34, 34, 34, 32, 32, 32, 31, 31, 1, 1, 1, 1, 1, 1] [2022-11-03 03:56:47,029 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-03 03:56:47,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:56:47,198 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-03 03:56:47,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:56:47,199 INFO L85 PathProgramCache]: Analyzing trace with hash 570507918, now seen corresponding path program 5 times [2022-11-03 03:56:47,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:56:47,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660935811] [2022-11-03 03:56:47,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:56:47,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:56:47,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:56:53,497 INFO L134 CoverageAnalysis]: Checked inductivity of 5917 backedges. 0 proven. 3078 refuted. 0 times theorem prover too weak. 2839 trivial. 0 not checked. [2022-11-03 03:56:53,497 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:56:53,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660935811] [2022-11-03 03:56:53,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660935811] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:56:53,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241222133] [2022-11-03 03:56:53,498 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:56:53,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:56:53,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:56:53,499 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:56:53,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f16031-3805-4748-9561-af66905e7bb7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-03 03:56:55,831 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2022-11-03 03:56:55,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:56:55,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 134 conjunts are in the unsatisfiable core [2022-11-03 03:56:55,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:56:59,066 INFO L134 CoverageAnalysis]: Checked inductivity of 5917 backedges. 0 proven. 3078 refuted. 0 times theorem prover too weak. 2839 trivial. 0 not checked. [2022-11-03 03:56:59,067 INFO L328 TraceCheckSpWp]: Computing backward predicates...