./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Primes.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a 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_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Primes.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16beca065b3aeb336c54dcf96f3abbe61553e7d28b28c1a40f525ad89a5da56e --- 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-38b53e6 [2022-11-26 00:06:41,087 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:06:41,090 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:06:41,116 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:06:41,117 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:06:41,118 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:06:41,119 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:06:41,121 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:06:41,123 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:06:41,124 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:06:41,125 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:06:41,126 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:06:41,127 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:06:41,128 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:06:41,130 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:06:41,131 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:06:41,132 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:06:41,133 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:06:41,135 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:06:41,137 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:06:41,139 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:06:41,140 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:06:41,141 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:06:41,142 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:06:41,146 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:06:41,147 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:06:41,147 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:06:41,148 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:06:41,149 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:06:41,150 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:06:41,150 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:06:41,151 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:06:41,152 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:06:41,153 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:06:41,154 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:06:41,154 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:06:41,170 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:06:41,171 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:06:41,171 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:06:41,172 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:06:41,173 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:06:41,174 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-26 00:06:41,219 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:06:41,220 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:06:41,221 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:06:41,221 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:06:41,222 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:06:41,222 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:06:41,223 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:06:41,223 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:06:41,223 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:06:41,223 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 00:06:41,224 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:06:41,225 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:06:41,225 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 00:06:41,225 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 00:06:41,225 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:06:41,225 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 00:06:41,226 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 00:06:41,226 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 00:06:41,227 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:06:41,228 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:06:41,228 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:06:41,228 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:06:41,228 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:06:41,228 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 00:06:41,229 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:06:41,229 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 00:06:41,230 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:06:41,230 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 00:06:41,230 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:06:41,230 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 00:06:41,231 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:06:41,231 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:06:41,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:06:41,232 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:06:41,232 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 00:06:41,232 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:06:41,232 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 00:06:41,233 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 00:06:41,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 00:06:41,233 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 00:06:41,234 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:06:41,234 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_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/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_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 16beca065b3aeb336c54dcf96f3abbe61553e7d28b28c1a40f525ad89a5da56e [2022-11-26 00:06:41,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:06:41,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:06:41,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:06:41,584 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:06:41,594 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:06:41,595 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/recursive/Primes.c [2022-11-26 00:06:44,557 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:06:44,740 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:06:44,740 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/sv-benchmarks/c/recursive/Primes.c [2022-11-26 00:06:44,747 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/data/d66f0336e/7742a6edf4eb49ce96f276d6b00664c3/FLAG93682f78c [2022-11-26 00:06:44,773 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/data/d66f0336e/7742a6edf4eb49ce96f276d6b00664c3 [2022-11-26 00:06:44,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:06:44,783 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:06:44,786 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:06:44,787 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:06:44,790 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:06:44,791 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:06:44" (1/1) ... [2022-11-26 00:06:44,793 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cf1ac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:44, skipping insertion in model container [2022-11-26 00:06:44,794 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:06:44" (1/1) ... [2022-11-26 00:06:44,801 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:06:44,826 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:06:45,022 WARN L237 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_74cd9405-28a4-4a24-a011-d86eed058751/sv-benchmarks/c/recursive/Primes.c[2190,2203] [2022-11-26 00:06:45,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:06:45,036 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:06:45,054 WARN L237 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_74cd9405-28a4-4a24-a011-d86eed058751/sv-benchmarks/c/recursive/Primes.c[2190,2203] [2022-11-26 00:06:45,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:06:45,067 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:06:45,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:45 WrapperNode [2022-11-26 00:06:45,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:06:45,069 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:06:45,069 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:06:45,069 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:06:45,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:45" (1/1) ... [2022-11-26 00:06:45,084 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:45" (1/1) ... [2022-11-26 00:06:45,103 INFO L138 Inliner]: procedures = 16, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2022-11-26 00:06:45,103 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:06:45,104 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:06:45,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:06:45,104 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:06:45,114 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:45" (1/1) ... [2022-11-26 00:06:45,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:45" (1/1) ... [2022-11-26 00:06:45,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:45" (1/1) ... [2022-11-26 00:06:45,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:45" (1/1) ... [2022-11-26 00:06:45,120 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:45" (1/1) ... [2022-11-26 00:06:45,123 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:45" (1/1) ... [2022-11-26 00:06:45,124 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:45" (1/1) ... [2022-11-26 00:06:45,125 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:45" (1/1) ... [2022-11-26 00:06:45,127 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:06:45,128 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:06:45,128 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:06:45,129 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:06:45,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:45" (1/1) ... [2022-11-26 00:06:45,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:06:45,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:06:45,160 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:06:45,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:06:45,208 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of [2022-11-26 00:06:45,208 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of [2022-11-26 00:06:45,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:06:45,208 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2022-11-26 00:06:45,209 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2022-11-26 00:06:45,209 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ [2022-11-26 00:06:45,209 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ [2022-11-26 00:06:45,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 00:06:45,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:06:45,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:06:45,301 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:06:45,305 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:06:45,614 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:06:45,631 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:06:45,632 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-26 00:06:45,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:06:45 BoogieIcfgContainer [2022-11-26 00:06:45,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:06:45,637 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:06:45,637 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:06:45,641 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:06:45,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:06:44" (1/3) ... [2022-11-26 00:06:45,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c95777 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:06:45, skipping insertion in model container [2022-11-26 00:06:45,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:06:45" (2/3) ... [2022-11-26 00:06:45,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c95777 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:06:45, skipping insertion in model container [2022-11-26 00:06:45,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:06:45" (3/3) ... [2022-11-26 00:06:45,644 INFO L112 eAbstractionObserver]: Analyzing ICFG Primes.c [2022-11-26 00:06:45,704 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:06:45,704 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-26 00:06:45,798 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:06:45,804 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;@25458fe0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:06:45,804 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-26 00:06:45,809 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 36 states have internal predecessors, (53), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-26 00:06:45,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-26 00:06:45,817 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:06:45,818 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:06:45,819 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:06:45,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:06:45,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1349448312, now seen corresponding path program 1 times [2022-11-26 00:06:45,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:06:45,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432017419] [2022-11-26 00:06:45,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:06:45,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:06:45,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:06:46,037 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-26 00:06:46,038 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:06:46,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432017419] [2022-11-26 00:06:46,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432017419] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:06:46,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:06:46,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:06:46,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121288445] [2022-11-26 00:06:46,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:06:46,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:06:46,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:06:46,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:06:46,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:06:46,078 INFO L87 Difference]: Start difference. First operand has 49 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 36 states have internal predecessors, (53), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-26 00:06:46,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:06:46,125 INFO L93 Difference]: Finished difference Result 54 states and 76 transitions. [2022-11-26 00:06:46,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:06:46,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-11-26 00:06:46,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:06:46,136 INFO L225 Difference]: With dead ends: 54 [2022-11-26 00:06:46,136 INFO L226 Difference]: Without dead ends: 47 [2022-11-26 00:06:46,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:06:46,143 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:06:46,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:06:46,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-26 00:06:46,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-11-26 00:06:46,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-26 00:06:46,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2022-11-26 00:06:46,184 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 13 [2022-11-26 00:06:46,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:06:46,185 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2022-11-26 00:06:46,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-26 00:06:46,186 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-11-26 00:06:46,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-26 00:06:46,188 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:06:46,189 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:06:46,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 00:06:46,189 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:06:46,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:06:46,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1094481281, now seen corresponding path program 1 times [2022-11-26 00:06:46,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:06:46,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935594577] [2022-11-26 00:06:46,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:06:46,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:06:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:06:46,492 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-26 00:06:46,493 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:06:46,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935594577] [2022-11-26 00:06:46,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935594577] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:06:46,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:06:46,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-26 00:06:46,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734821133] [2022-11-26 00:06:46,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:06:46,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 00:06:46,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:06:46,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 00:06:46,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:06:46,498 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 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-26 00:06:46,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:06:46,593 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2022-11-26 00:06:46,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 00:06:46,610 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 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 20 [2022-11-26 00:06:46,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:06:46,613 INFO L225 Difference]: With dead ends: 53 [2022-11-26 00:06:46,613 INFO L226 Difference]: Without dead ends: 49 [2022-11-26 00:06:46,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:06:46,615 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 5 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:06:46,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 230 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:06:46,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-26 00:06:46,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-11-26 00:06:46,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-11-26 00:06:46,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 67 transitions. [2022-11-26 00:06:46,632 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 67 transitions. Word has length 20 [2022-11-26 00:06:46,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:06:46,632 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 67 transitions. [2022-11-26 00:06:46,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 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-26 00:06:46,633 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 67 transitions. [2022-11-26 00:06:46,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-26 00:06:46,634 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:06:46,635 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:06:46,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-26 00:06:46,635 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:06:46,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:06:46,636 INFO L85 PathProgramCache]: Analyzing trace with hash 268966181, now seen corresponding path program 1 times [2022-11-26 00:06:46,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:06:46,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662540450] [2022-11-26 00:06:46,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:06:46,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:06:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:06:46,782 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-26 00:06:46,782 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:06:46,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662540450] [2022-11-26 00:06:46,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662540450] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:06:46,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:06:46,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-26 00:06:46,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396122329] [2022-11-26 00:06:46,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:06:46,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:06:46,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:06:46,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:06:46,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:06:46,786 INFO L87 Difference]: Start difference. First operand 49 states and 67 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 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-26 00:06:46,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:06:46,888 INFO L93 Difference]: Finished difference Result 55 states and 74 transitions. [2022-11-26 00:06:46,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:06:46,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 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 21 [2022-11-26 00:06:46,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:06:46,890 INFO L225 Difference]: With dead ends: 55 [2022-11-26 00:06:46,890 INFO L226 Difference]: Without dead ends: 51 [2022-11-26 00:06:46,891 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-26 00:06:46,892 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 9 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:06:46,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 194 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:06:46,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-26 00:06:46,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2022-11-26 00:06:46,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-11-26 00:06:46,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 67 transitions. [2022-11-26 00:06:46,916 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 67 transitions. Word has length 21 [2022-11-26 00:06:46,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:06:46,917 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 67 transitions. [2022-11-26 00:06:46,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 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-26 00:06:46,917 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 67 transitions. [2022-11-26 00:06:46,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-26 00:06:46,919 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:06:46,919 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:06:46,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-26 00:06:46,920 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:06:46,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:06:46,920 INFO L85 PathProgramCache]: Analyzing trace with hash 47098385, now seen corresponding path program 1 times [2022-11-26 00:06:46,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:06:46,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444566681] [2022-11-26 00:06:46,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:06:46,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:06:46,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:06:47,068 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-26 00:06:47,069 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:06:47,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444566681] [2022-11-26 00:06:47,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444566681] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:06:47,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:06:47,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-26 00:06:47,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794568934] [2022-11-26 00:06:47,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:06:47,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 00:06:47,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:06:47,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 00:06:47,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:06:47,072 INFO L87 Difference]: Start difference. First operand 49 states and 67 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 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-26 00:06:47,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:06:47,157 INFO L93 Difference]: Finished difference Result 72 states and 96 transitions. [2022-11-26 00:06:47,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 00:06:47,158 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 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 28 [2022-11-26 00:06:47,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:06:47,160 INFO L225 Difference]: With dead ends: 72 [2022-11-26 00:06:47,160 INFO L226 Difference]: Without dead ends: 51 [2022-11-26 00:06:47,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:06:47,162 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 1 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:06:47,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 294 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:06:47,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-26 00:06:47,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-11-26 00:06:47,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 38 states have internal predecessors, (48), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-11-26 00:06:47,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2022-11-26 00:06:47,179 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 28 [2022-11-26 00:06:47,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:06:47,180 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2022-11-26 00:06:47,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 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-26 00:06:47,181 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-11-26 00:06:47,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-26 00:06:47,183 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:06:47,183 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:06:47,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-26 00:06:47,184 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:06:47,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:06:47,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1677803704, now seen corresponding path program 1 times [2022-11-26 00:06:47,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:06:47,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640658730] [2022-11-26 00:06:47,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:06:47,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:06:47,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:06:47,373 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:06:47,373 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:06:47,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640658730] [2022-11-26 00:06:47,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640658730] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:06:47,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491348002] [2022-11-26 00:06:47,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:06:47,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:06:47,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:06:47,382 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:06:47,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 00:06:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:06:47,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-26 00:06:47,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:06:47,620 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-26 00:06:47,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:06:47,804 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:06:47,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491348002] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:06:47,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [541054845] [2022-11-26 00:06:47,825 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2022-11-26 00:06:47,825 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:06:47,830 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:337) 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-26 00:06:47,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:06:47,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2022-11-26 00:06:47,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250104470] [2022-11-26 00:06:47,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:06:47,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-26 00:06:47,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:06:47,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-26 00:06:47,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-11-26 00:06:47,849 INFO L87 Difference]: Start difference. First operand 51 states and 69 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-26 00:06:48,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:06:48,031 INFO L93 Difference]: Finished difference Result 66 states and 88 transitions. [2022-11-26 00:06:48,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-26 00:06:48,032 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 29 [2022-11-26 00:06:48,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:06:48,039 INFO L225 Difference]: With dead ends: 66 [2022-11-26 00:06:48,040 INFO L226 Difference]: Without dead ends: 49 [2022-11-26 00:06:48,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-11-26 00:06:48,045 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 31 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:06:48,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 253 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:06:48,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-26 00:06:48,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-11-26 00:06:48,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 37 states have internal predecessors, (45), 8 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-26 00:06:48,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2022-11-26 00:06:48,074 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 29 [2022-11-26 00:06:48,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:06:48,074 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2022-11-26 00:06:48,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-26 00:06:48,075 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2022-11-26 00:06:48,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-26 00:06:48,076 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:06:48,077 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:06:48,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-26 00:06:48,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:06:48,278 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:06:48,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:06:48,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1617599152, now seen corresponding path program 1 times [2022-11-26 00:06:48,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:06:48,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731271304] [2022-11-26 00:06:48,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:06:48,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:06:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:06:48,519 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:06:48,520 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:06:48,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731271304] [2022-11-26 00:06:48,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731271304] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:06:48,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311104364] [2022-11-26 00:06:48,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:06:48,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:06:48,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:06:48,523 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:06:48,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 00:06:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:06:48,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-26 00:06:48,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:06:48,853 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:06:48,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:06:49,263 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:06:49,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311104364] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:06:49,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [579342975] [2022-11-26 00:06:49,273 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2022-11-26 00:06:49,273 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:06:49,276 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:337) 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-26 00:06:49,276 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:06:49,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2022-11-26 00:06:49,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144257651] [2022-11-26 00:06:49,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:06:49,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-26 00:06:49,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:06:49,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-26 00:06:49,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2022-11-26 00:06:49,287 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand has 22 states, 20 states have (on average 2.15) internal successors, (43), 16 states have internal predecessors, (43), 6 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-26 00:06:49,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:06:49,671 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2022-11-26 00:06:49,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-26 00:06:49,672 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.15) internal successors, (43), 16 states have internal predecessors, (43), 6 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) Word has length 30 [2022-11-26 00:06:49,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:06:49,673 INFO L225 Difference]: With dead ends: 68 [2022-11-26 00:06:49,673 INFO L226 Difference]: Without dead ends: 52 [2022-11-26 00:06:49,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=852, Unknown=0, NotChecked=0, Total=992 [2022-11-26 00:06:49,675 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 51 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:06:49,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 461 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:06:49,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-26 00:06:49,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2022-11-26 00:06:49,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.2) internal successors, (42), 37 states have internal predecessors, (42), 8 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-26 00:06:49,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2022-11-26 00:06:49,694 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 30 [2022-11-26 00:06:49,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:06:49,694 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2022-11-26 00:06:49,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.15) internal successors, (43), 16 states have internal predecessors, (43), 6 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-26 00:06:49,695 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2022-11-26 00:06:49,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-26 00:06:49,696 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:06:49,696 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:06:49,715 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-26 00:06:49,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-26 00:06:49,908 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:06:49,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:06:49,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1287840268, now seen corresponding path program 1 times [2022-11-26 00:06:49,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:06:49,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215522027] [2022-11-26 00:06:49,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:06:49,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:06:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:06:50,034 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 00:06:50,035 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:06:50,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215522027] [2022-11-26 00:06:50,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215522027] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:06:50,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:06:50,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-26 00:06:50,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730688992] [2022-11-26 00:06:50,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:06:50,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-26 00:06:50,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:06:50,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-26 00:06:50,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:06:50,037 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-26 00:06:50,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:06:50,094 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-11-26 00:06:50,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 00:06:50,095 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2022-11-26 00:06:50,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:06:50,099 INFO L225 Difference]: With dead ends: 70 [2022-11-26 00:06:50,100 INFO L226 Difference]: Without dead ends: 51 [2022-11-26 00:06:50,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-26 00:06:50,104 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 35 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:06:50,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 163 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:06:50,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-26 00:06:50,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2022-11-26 00:06:50,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.2) internal successors, (42), 37 states have internal predecessors, (42), 8 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-26 00:06:50,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2022-11-26 00:06:50,114 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 32 [2022-11-26 00:06:50,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:06:50,115 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2022-11-26 00:06:50,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-26 00:06:50,115 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2022-11-26 00:06:50,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-26 00:06:50,119 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:06:50,120 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:06:50,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-26 00:06:50,120 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:06:50,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:06:50,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1285376925, now seen corresponding path program 1 times [2022-11-26 00:06:50,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:06:50,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583318602] [2022-11-26 00:06:50,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:06:50,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:06:50,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:06:50,218 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-26 00:06:50,218 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:06:50,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583318602] [2022-11-26 00:06:50,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583318602] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:06:50,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:06:50,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:06:50,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244110043] [2022-11-26 00:06:50,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:06:50,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:06:50,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:06:50,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:06:50,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:06:50,222 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-26 00:06:50,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:06:50,259 INFO L93 Difference]: Finished difference Result 99 states and 126 transitions. [2022-11-26 00:06:50,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:06:50,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2022-11-26 00:06:50,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:06:50,261 INFO L225 Difference]: With dead ends: 99 [2022-11-26 00:06:50,262 INFO L226 Difference]: Without dead ends: 53 [2022-11-26 00:06:50,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:06:50,267 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:06:50,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:06:50,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-26 00:06:50,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-26 00:06:50,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 8 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (14), 9 states have call predecessors, (14), 8 states have call successors, (14) [2022-11-26 00:06:50,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2022-11-26 00:06:50,275 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 50 [2022-11-26 00:06:50,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:06:50,275 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2022-11-26 00:06:50,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-26 00:06:50,276 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2022-11-26 00:06:50,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-26 00:06:50,277 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:06:50,277 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:06:50,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-26 00:06:50,277 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:06:50,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:06:50,278 INFO L85 PathProgramCache]: Analyzing trace with hash -68737779, now seen corresponding path program 1 times [2022-11-26 00:06:50,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:06:50,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114550477] [2022-11-26 00:06:50,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:06:50,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:06:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:06:50,353 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-26 00:06:50,354 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:06:50,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114550477] [2022-11-26 00:06:50,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114550477] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:06:50,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50625739] [2022-11-26 00:06:50,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:06:50,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:06:50,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:06:50,358 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:06:50,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-26 00:06:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:06:50,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-26 00:06:50,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:06:50,460 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-26 00:06:50,460 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:06:50,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50625739] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:06:50,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 00:06:50,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-11-26 00:06:50,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792321757] [2022-11-26 00:06:50,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:06:50,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:06:50,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:06:50,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:06:50,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:06:50,464 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-26 00:06:50,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:06:50,529 INFO L93 Difference]: Finished difference Result 106 states and 139 transitions. [2022-11-26 00:06:50,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:06:50,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) Word has length 51 [2022-11-26 00:06:50,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:06:50,532 INFO L225 Difference]: With dead ends: 106 [2022-11-26 00:06:50,532 INFO L226 Difference]: Without dead ends: 56 [2022-11-26 00:06:50,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:06:50,537 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 17 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:06:50,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 147 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:06:50,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-26 00:06:50,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-11-26 00:06:50,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.175) internal successors, (47), 42 states have internal predecessors, (47), 8 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (17), 10 states have call predecessors, (17), 8 states have call successors, (17) [2022-11-26 00:06:50,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2022-11-26 00:06:50,556 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 72 transitions. Word has length 51 [2022-11-26 00:06:50,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:06:50,557 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 72 transitions. [2022-11-26 00:06:50,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-26 00:06:50,557 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2022-11-26 00:06:50,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-26 00:06:50,558 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:06:50,559 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:06:50,565 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-26 00:06:50,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:06:50,766 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:06:50,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:06:50,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1129977969, now seen corresponding path program 1 times [2022-11-26 00:06:50,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:06:50,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965869314] [2022-11-26 00:06:50,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:06:50,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:06:50,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:06:50,840 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-26 00:06:50,841 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:06:50,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965869314] [2022-11-26 00:06:50,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965869314] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:06:50,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:06:50,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-26 00:06:50,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161347546] [2022-11-26 00:06:50,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:06:50,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:06:50,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:06:50,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:06:50,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:06:50,843 INFO L87 Difference]: Start difference. First operand 56 states and 72 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-26 00:06:50,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:06:50,875 INFO L93 Difference]: Finished difference Result 114 states and 151 transitions. [2022-11-26 00:06:50,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:06:50,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 56 [2022-11-26 00:06:50,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:06:50,877 INFO L225 Difference]: With dead ends: 114 [2022-11-26 00:06:50,877 INFO L226 Difference]: Without dead ends: 61 [2022-11-26 00:06:50,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:06:50,878 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:06:50,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 195 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:06:50,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-26 00:06:50,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2022-11-26 00:06:50,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.170731707317073) internal successors, (48), 42 states have internal predecessors, (48), 8 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (17), 11 states have call predecessors, (17), 8 states have call successors, (17) [2022-11-26 00:06:50,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 73 transitions. [2022-11-26 00:06:50,886 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 73 transitions. Word has length 56 [2022-11-26 00:06:50,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:06:50,886 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 73 transitions. [2022-11-26 00:06:50,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-26 00:06:50,887 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 73 transitions. [2022-11-26 00:06:50,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-26 00:06:50,888 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:06:50,888 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:06:50,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-26 00:06:50,888 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:06:50,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:06:50,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1501667645, now seen corresponding path program 1 times [2022-11-26 00:06:50,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:06:50,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417730923] [2022-11-26 00:06:50,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:06:50,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:06:50,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:06:50,975 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-26 00:06:50,976 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:06:50,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417730923] [2022-11-26 00:06:50,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417730923] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:06:50,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:06:50,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-26 00:06:50,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143465028] [2022-11-26 00:06:50,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:06:50,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 00:06:50,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:06:50,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 00:06:50,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:06:50,978 INFO L87 Difference]: Start difference. First operand 57 states and 73 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-26 00:06:51,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:06:51,014 INFO L93 Difference]: Finished difference Result 117 states and 154 transitions. [2022-11-26 00:06:51,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 00:06:51,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-11-26 00:06:51,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:06:51,017 INFO L225 Difference]: With dead ends: 117 [2022-11-26 00:06:51,017 INFO L226 Difference]: Without dead ends: 63 [2022-11-26 00:06:51,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:06:51,018 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:06:51,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 242 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:06:51,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-26 00:06:51,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 58. [2022-11-26 00:06:51,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 8 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (17), 12 states have call predecessors, (17), 8 states have call successors, (17) [2022-11-26 00:06:51,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 74 transitions. [2022-11-26 00:06:51,026 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 74 transitions. Word has length 65 [2022-11-26 00:06:51,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:06:51,026 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 74 transitions. [2022-11-26 00:06:51,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-26 00:06:51,027 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 74 transitions. [2022-11-26 00:06:51,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-26 00:06:51,028 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:06:51,028 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:06:51,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-26 00:06:51,028 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:06:51,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:06:51,029 INFO L85 PathProgramCache]: Analyzing trace with hash -2075972807, now seen corresponding path program 1 times [2022-11-26 00:06:51,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:06:51,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226208850] [2022-11-26 00:06:51,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:06:51,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:06:51,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:06:51,110 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-26 00:06:51,111 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:06:51,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226208850] [2022-11-26 00:06:51,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226208850] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:06:51,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677721951] [2022-11-26 00:06:51,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:06:51,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:06:51,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:06:51,113 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:06:51,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-26 00:06:51,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:06:51,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-26 00:06:51,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:06:51,233 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-26 00:06:51,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:06:51,463 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-26 00:06:51,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677721951] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:06:51,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [457832358] [2022-11-26 00:06:51,467 INFO L159 IcfgInterpreter]: Started Sifa with 43 locations of interest [2022-11-26 00:06:51,467 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:06:51,468 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java: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:337) 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-26 00:06:51,468 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:06:51,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-11-26 00:06:51,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400733811] [2022-11-26 00:06:51,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:06:51,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-26 00:06:51,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:06:51,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-26 00:06:51,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:06:51,471 INFO L87 Difference]: Start difference. First operand 58 states and 74 transitions. Second operand has 7 states, 5 states have (on average 12.2) internal successors, (61), 7 states have internal predecessors, (61), 7 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 7 states have call successors, (12) [2022-11-26 00:06:51,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:06:51,553 INFO L93 Difference]: Finished difference Result 124 states and 166 transitions. [2022-11-26 00:06:51,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:06:51,554 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.2) internal successors, (61), 7 states have internal predecessors, (61), 7 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 7 states have call successors, (12) Word has length 66 [2022-11-26 00:06:51,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:06:51,556 INFO L225 Difference]: With dead ends: 124 [2022-11-26 00:06:51,556 INFO L226 Difference]: Without dead ends: 56 [2022-11-26 00:06:51,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 129 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-26 00:06:51,557 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 20 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:06:51,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 162 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:06:51,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-26 00:06:51,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2022-11-26 00:06:51,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 41 states have internal predecessors, (45), 7 states have call successors, (7), 3 states have call predecessors, (7), 7 states have return successors, (14), 9 states have call predecessors, (14), 7 states have call successors, (14) [2022-11-26 00:06:51,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2022-11-26 00:06:51,573 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 66 [2022-11-26 00:06:51,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:06:51,574 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2022-11-26 00:06:51,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.2) internal successors, (61), 7 states have internal predecessors, (61), 7 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 7 states have call successors, (12) [2022-11-26 00:06:51,574 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2022-11-26 00:06:51,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-26 00:06:51,577 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:06:51,577 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:06:51,591 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-26 00:06:51,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:06:51,791 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:06:51,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:06:51,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1627957863, now seen corresponding path program 1 times [2022-11-26 00:06:51,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:06:51,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361574634] [2022-11-26 00:06:51,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:06:51,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:06:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:06:51,912 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-26 00:06:51,912 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:06:51,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361574634] [2022-11-26 00:06:51,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361574634] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:06:51,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:06:51,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-26 00:06:51,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687217342] [2022-11-26 00:06:51,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:06:51,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 00:06:51,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:06:51,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 00:06:51,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:06:51,914 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-26 00:06:51,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:06:51,946 INFO L93 Difference]: Finished difference Result 113 states and 142 transitions. [2022-11-26 00:06:51,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 00:06:51,948 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-11-26 00:06:51,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:06:51,949 INFO L225 Difference]: With dead ends: 113 [2022-11-26 00:06:51,949 INFO L226 Difference]: Without dead ends: 62 [2022-11-26 00:06:51,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:06:51,950 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:06:51,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 224 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:06:51,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-26 00:06:51,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2022-11-26 00:06:51,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.146341463414634) internal successors, (47), 43 states have internal predecessors, (47), 7 states have call successors, (7), 3 states have call predecessors, (7), 8 states have return successors, (16), 10 states have call predecessors, (16), 7 states have call successors, (16) [2022-11-26 00:06:51,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2022-11-26 00:06:51,956 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 66 [2022-11-26 00:06:51,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:06:51,957 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2022-11-26 00:06:51,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-26 00:06:51,957 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2022-11-26 00:06:51,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-26 00:06:51,958 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:06:51,958 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:06:51,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-26 00:06:51,958 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:06:51,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:06:51,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1340831987, now seen corresponding path program 1 times [2022-11-26 00:06:51,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:06:51,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536484501] [2022-11-26 00:06:51,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:06:51,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:06:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:06:52,085 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-26 00:06:52,085 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:06:52,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536484501] [2022-11-26 00:06:52,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536484501] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:06:52,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158455210] [2022-11-26 00:06:52,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:06:52,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:06:52,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:06:52,087 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:06:52,117 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-26 00:06:52,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:06:52,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-26 00:06:52,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:06:52,282 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-26 00:06:52,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:06:52,626 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-26 00:06:52,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158455210] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:06:52,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [408196821] [2022-11-26 00:06:52,629 INFO L159 IcfgInterpreter]: Started Sifa with 41 locations of interest [2022-11-26 00:06:52,629 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:06:52,630 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:337) 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-26 00:06:52,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:06:52,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2022-11-26 00:06:52,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013619822] [2022-11-26 00:06:52,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:06:52,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-26 00:06:52,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:06:52,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-26 00:06:52,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-11-26 00:06:52,633 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 9 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (12), 4 states have call predecessors, (12), 9 states have call successors, (12) [2022-11-26 00:06:52,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:06:52,824 INFO L93 Difference]: Finished difference Result 92 states and 116 transitions. [2022-11-26 00:06:52,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-26 00:06:52,824 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 9 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (12), 4 states have call predecessors, (12), 9 states have call successors, (12) Word has length 60 [2022-11-26 00:06:52,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:06:52,825 INFO L225 Difference]: With dead ends: 92 [2022-11-26 00:06:52,825 INFO L226 Difference]: Without dead ends: 63 [2022-11-26 00:06:52,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 113 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-11-26 00:06:52,826 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 30 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:06:52,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 267 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:06:52,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-26 00:06:52,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-26 00:06:52,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 47 states have internal predecessors, (51), 7 states have call successors, (7), 3 states have call predecessors, (7), 10 states have return successors, (20), 12 states have call predecessors, (20), 7 states have call successors, (20) [2022-11-26 00:06:52,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2022-11-26 00:06:52,832 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 60 [2022-11-26 00:06:52,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:06:52,832 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2022-11-26 00:06:52,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 9 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (12), 4 states have call predecessors, (12), 9 states have call successors, (12) [2022-11-26 00:06:52,832 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2022-11-26 00:06:52,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-26 00:06:52,833 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:06:52,833 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:06:52,846 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-26 00:06:53,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-26 00:06:53,034 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:06:53,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:06:53,034 INFO L85 PathProgramCache]: Analyzing trace with hash -2129490437, now seen corresponding path program 2 times [2022-11-26 00:06:53,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:06:53,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047367946] [2022-11-26 00:06:53,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:06:53,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:06:53,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:06:53,248 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-26 00:06:53,248 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:06:53,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047367946] [2022-11-26 00:06:53,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047367946] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:06:53,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118790064] [2022-11-26 00:06:53,249 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:06:53,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:06:53,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:06:53,250 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:06:53,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-26 00:06:53,330 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-26 00:06:53,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:06:53,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-26 00:06:53,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:06:53,541 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-26 00:06:53,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:06:54,267 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-26 00:06:54,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118790064] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:06:54,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [11133648] [2022-11-26 00:06:54,274 INFO L159 IcfgInterpreter]: Started Sifa with 41 locations of interest [2022-11-26 00:06:54,274 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:06:54,275 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:337) 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-26 00:06:54,275 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:06:54,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 20 [2022-11-26 00:06:54,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347712474] [2022-11-26 00:06:54,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:06:54,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-26 00:06:54,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:06:54,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-26 00:06:54,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2022-11-26 00:06:54,277 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand has 20 states, 17 states have (on average 5.294117647058823) internal successors, (90), 20 states have internal predecessors, (90), 12 states have call successors, (15), 2 states have call predecessors, (15), 7 states have return successors, (17), 6 states have call predecessors, (17), 12 states have call successors, (17) [2022-11-26 00:06:54,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:06:54,576 INFO L93 Difference]: Finished difference Result 105 states and 134 transitions. [2022-11-26 00:06:54,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-26 00:06:54,577 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 5.294117647058823) internal successors, (90), 20 states have internal predecessors, (90), 12 states have call successors, (15), 2 states have call predecessors, (15), 7 states have return successors, (17), 6 states have call predecessors, (17), 12 states have call successors, (17) Word has length 69 [2022-11-26 00:06:54,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:06:54,579 INFO L225 Difference]: With dead ends: 105 [2022-11-26 00:06:54,579 INFO L226 Difference]: Without dead ends: 86 [2022-11-26 00:06:54,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 126 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2022-11-26 00:06:54,582 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 52 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:06:54,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 376 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:06:54,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-26 00:06:54,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2022-11-26 00:06:54,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 55 states have internal predecessors, (60), 8 states have call successors, (8), 3 states have call predecessors, (8), 13 states have return successors, (29), 16 states have call predecessors, (29), 8 states have call successors, (29) [2022-11-26 00:06:54,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 97 transitions. [2022-11-26 00:06:54,593 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 97 transitions. Word has length 69 [2022-11-26 00:06:54,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:06:54,594 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 97 transitions. [2022-11-26 00:06:54,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 5.294117647058823) internal successors, (90), 20 states have internal predecessors, (90), 12 states have call successors, (15), 2 states have call predecessors, (15), 7 states have return successors, (17), 6 states have call predecessors, (17), 12 states have call successors, (17) [2022-11-26 00:06:54,594 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 97 transitions. [2022-11-26 00:06:54,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-26 00:06:54,595 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:06:54,595 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:06:54,607 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-26 00:06:54,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:06:54,802 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:06:54,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:06:54,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1734203497, now seen corresponding path program 1 times [2022-11-26 00:06:54,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:06:54,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347045382] [2022-11-26 00:06:54,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:06:54,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:06:54,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:06:54,866 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-26 00:06:54,866 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:06:54,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347045382] [2022-11-26 00:06:54,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347045382] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:06:54,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:06:54,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-26 00:06:54,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770195220] [2022-11-26 00:06:54,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:06:54,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:06:54,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:06:54,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:06:54,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:06:54,869 INFO L87 Difference]: Start difference. First operand 75 states and 97 transitions. Second operand has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-26 00:06:54,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:06:54,916 INFO L93 Difference]: Finished difference Result 147 states and 212 transitions. [2022-11-26 00:06:54,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:06:54,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 76 [2022-11-26 00:06:54,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:06:54,918 INFO L225 Difference]: With dead ends: 147 [2022-11-26 00:06:54,919 INFO L226 Difference]: Without dead ends: 75 [2022-11-26 00:06:54,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:06:54,920 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:06:54,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 156 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:06:54,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-26 00:06:54,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-11-26 00:06:54,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 55 states have internal predecessors, (60), 8 states have call successors, (8), 3 states have call predecessors, (8), 13 states have return successors, (26), 16 states have call predecessors, (26), 8 states have call successors, (26) [2022-11-26 00:06:54,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 94 transitions. [2022-11-26 00:06:54,931 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 94 transitions. Word has length 76 [2022-11-26 00:06:54,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:06:54,932 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 94 transitions. [2022-11-26 00:06:54,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-26 00:06:54,933 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 94 transitions. [2022-11-26 00:06:54,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-26 00:06:54,934 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:06:54,934 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:06:54,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-26 00:06:54,934 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:06:54,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:06:54,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1605702583, now seen corresponding path program 2 times [2022-11-26 00:06:54,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:06:54,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090330324] [2022-11-26 00:06:54,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:06:54,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:06:54,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:06:55,143 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 36 proven. 19 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-26 00:06:55,143 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:06:55,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090330324] [2022-11-26 00:06:55,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090330324] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:06:55,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361104141] [2022-11-26 00:06:55,144 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:06:55,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:06:55,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:06:55,145 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:06:55,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-26 00:06:55,237 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-26 00:06:55,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:06:55,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-26 00:06:55,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:06:55,413 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 41 proven. 13 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-26 00:06:55,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:06:56,280 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 38 proven. 15 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-26 00:06:56,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361104141] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:06:56,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2011080610] [2022-11-26 00:06:56,285 INFO L159 IcfgInterpreter]: Started Sifa with 43 locations of interest [2022-11-26 00:06:56,285 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:06:56,286 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:337) 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-26 00:06:56,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:06:56,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 21 [2022-11-26 00:06:56,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171345697] [2022-11-26 00:06:56,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:06:56,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-26 00:06:56,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:06:56,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-26 00:06:56,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2022-11-26 00:06:56,290 INFO L87 Difference]: Start difference. First operand 75 states and 94 transitions. Second operand has 21 states, 19 states have (on average 5.105263157894737) internal successors, (97), 21 states have internal predecessors, (97), 9 states have call successors, (17), 2 states have call predecessors, (17), 8 states have return successors, (17), 6 states have call predecessors, (17), 9 states have call successors, (17) [2022-11-26 00:06:56,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:06:56,531 INFO L93 Difference]: Finished difference Result 118 states and 166 transitions. [2022-11-26 00:06:56,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-26 00:06:56,531 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 5.105263157894737) internal successors, (97), 21 states have internal predecessors, (97), 9 states have call successors, (17), 2 states have call predecessors, (17), 8 states have return successors, (17), 6 states have call predecessors, (17), 9 states have call successors, (17) Word has length 85 [2022-11-26 00:06:56,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:06:56,531 INFO L225 Difference]: With dead ends: 118 [2022-11-26 00:06:56,531 INFO L226 Difference]: Without dead ends: 0 [2022-11-26 00:06:56,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 155 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=214, Invalid=656, Unknown=0, NotChecked=0, Total=870 [2022-11-26 00:06:56,533 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 30 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:06:56,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 226 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:06:56,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-26 00:06:56,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-26 00:06:56,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:06:56,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-26 00:06:56,534 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2022-11-26 00:06:56,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:06:56,534 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-26 00:06:56,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 5.105263157894737) internal successors, (97), 21 states have internal predecessors, (97), 9 states have call successors, (17), 2 states have call predecessors, (17), 8 states have return successors, (17), 6 states have call predecessors, (17), 9 states have call successors, (17) [2022-11-26 00:06:56,534 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-26 00:06:56,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-26 00:06:56,537 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-26 00:06:56,549 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-26 00:06:56,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-26 00:06:56,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-26 00:06:56,968 INFO L895 garLoopResultBuilder]: At program point L33(line 33) the Hoare annotation is: (and (<= |multiple_of_#in~n| multiple_of_~n) (<= |multiple_of_#in~m| multiple_of_~m) (<= (+ |multiple_of_#in~m| 1) 0)) [2022-11-26 00:06:56,968 INFO L899 garLoopResultBuilder]: For program point L32(lines 32 34) no Hoare annotation was computed. [2022-11-26 00:06:56,969 INFO L899 garLoopResultBuilder]: For program point L33-1(line 33) no Hoare annotation was computed. [2022-11-26 00:06:56,969 INFO L899 garLoopResultBuilder]: For program point multiple_ofFINAL(lines 31 45) no Hoare annotation was computed. [2022-11-26 00:06:56,969 INFO L895 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: (and (= |multiple_of_#in~m| multiple_of_~m) (= |multiple_of_#in~n| multiple_of_~n) (< 0 multiple_of_~n)) [2022-11-26 00:06:56,969 INFO L899 garLoopResultBuilder]: For program point L44-1(line 44) no Hoare annotation was computed. [2022-11-26 00:06:56,969 INFO L902 garLoopResultBuilder]: At program point multiple_ofENTRY(lines 31 45) the Hoare annotation is: true [2022-11-26 00:06:56,969 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 43) no Hoare annotation was computed. [2022-11-26 00:06:56,969 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 40) no Hoare annotation was computed. [2022-11-26 00:06:56,969 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (and (<= (+ multiple_of_~n 1) 0) (= |multiple_of_#in~m| multiple_of_~m) (= |multiple_of_#in~n| multiple_of_~n)) [2022-11-26 00:06:56,969 INFO L899 garLoopResultBuilder]: For program point multiple_ofEXIT(lines 31 45) no Hoare annotation was computed. [2022-11-26 00:06:56,969 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 37) no Hoare annotation was computed. [2022-11-26 00:06:56,970 INFO L899 garLoopResultBuilder]: For program point L36-1(line 36) no Hoare annotation was computed. [2022-11-26 00:06:56,970 INFO L902 garLoopResultBuilder]: At program point multENTRY(lines 17 28) the Hoare annotation is: true [2022-11-26 00:06:56,970 INFO L895 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (and (= |mult_#in~n| mult_~n) (<= |mult_#in~m| mult_~m) (< 1 mult_~m)) [2022-11-26 00:06:56,970 INFO L899 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2022-11-26 00:06:56,970 INFO L899 garLoopResultBuilder]: For program point L24(lines 24 26) no Hoare annotation was computed. [2022-11-26 00:06:56,970 INFO L899 garLoopResultBuilder]: For program point L21(lines 21 23) no Hoare annotation was computed. [2022-11-26 00:06:56,970 INFO L895 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (and (<= |mult_#in~m| mult_~m) (<= |mult_#in~m| 0)) [2022-11-26 00:06:56,970 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-11-26 00:06:56,970 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2022-11-26 00:06:56,970 INFO L899 garLoopResultBuilder]: For program point multFINAL(lines 17 28) no Hoare annotation was computed. [2022-11-26 00:06:56,970 INFO L899 garLoopResultBuilder]: For program point multEXIT(lines 17 28) no Hoare annotation was computed. [2022-11-26 00:06:56,971 INFO L899 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2022-11-26 00:06:56,971 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-26 00:06:56,971 INFO L895 garLoopResultBuilder]: At program point L97-1(line 97) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~n~0#1| 2) (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_is_prime_~n#1|)) [2022-11-26 00:06:56,971 INFO L899 garLoopResultBuilder]: For program point L97-2(line 97) no Hoare annotation was computed. [2022-11-26 00:06:56,971 INFO L899 garLoopResultBuilder]: For program point L97-4(lines 97 101) no Hoare annotation was computed. [2022-11-26 00:06:56,971 INFO L899 garLoopResultBuilder]: For program point L91(lines 91 95) no Hoare annotation was computed. [2022-11-26 00:06:56,971 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 89) no Hoare annotation was computed. [2022-11-26 00:06:56,971 INFO L902 garLoopResultBuilder]: At program point L100(lines 76 102) the Hoare annotation is: true [2022-11-26 00:06:56,971 INFO L899 garLoopResultBuilder]: For program point L98(line 98) no Hoare annotation was computed. [2022-11-26 00:06:56,971 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-26 00:06:56,971 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 98) no Hoare annotation was computed. [2022-11-26 00:06:56,972 INFO L895 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_is_prime_~n#1|)) [2022-11-26 00:06:56,972 INFO L895 garLoopResultBuilder]: At program point L53-1(line 53) the Hoare annotation is: (let ((.cse0 (<= 1 |ULTIMATE.start_main_~n~0#1|))) (or (and (= |ULTIMATE.start_is_prime_#t~ret9#1| 0) .cse0) (and (<= |ULTIMATE.start_main_~n~0#1| 2) .cse0 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_is_prime_~n#1|)))) [2022-11-26 00:06:56,972 INFO L899 garLoopResultBuilder]: For program point L78(lines 78 82) no Hoare annotation was computed. [2022-11-26 00:06:56,972 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 72) no Hoare annotation was computed. [2022-11-26 00:06:56,972 INFO L899 garLoopResultBuilder]: For program point is_prime_EXIT(lines 57 74) no Hoare annotation was computed. [2022-11-26 00:06:56,972 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 73) no Hoare annotation was computed. [2022-11-26 00:06:56,972 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 63) no Hoare annotation was computed. [2022-11-26 00:06:56,972 INFO L899 garLoopResultBuilder]: For program point is_prime_FINAL(lines 57 74) no Hoare annotation was computed. [2022-11-26 00:06:56,972 INFO L902 garLoopResultBuilder]: At program point is_prime_ENTRY(lines 57 74) the Hoare annotation is: true [2022-11-26 00:06:56,972 INFO L899 garLoopResultBuilder]: For program point L58(lines 58 60) no Hoare annotation was computed. [2022-11-26 00:06:56,973 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (let ((.cse0 (<= (+ |is_prime__#in~m| is_prime__~n) (+ |is_prime__#in~n| is_prime__~m))) (.cse1 (<= |is_prime__#in~n| is_prime__~n)) (.cse2 (<= is_prime__~m |is_prime__#in~m|))) (or (and (<= |is_prime__#in~n| |is_prime__#in~m|) .cse0 .cse1 (< 2 is_prime__~n) .cse2) (and (<= (* 2 |is_prime__#in~m|) |is_prime__#in~n|) (<= 2 is_prime__~m) .cse0 .cse1 .cse2))) [2022-11-26 00:06:56,973 INFO L899 garLoopResultBuilder]: For program point L71-1(line 71) no Hoare annotation was computed. [2022-11-26 00:06:56,973 INFO L895 garLoopResultBuilder]: At program point L68(line 68) the Hoare annotation is: (and (<= 2 is_prime__~m) (<= (+ |is_prime__#in~m| is_prime__~n) (+ |is_prime__#in~n| is_prime__~m)) (<= |is_prime__#in~n| is_prime__~n) (< 2 is_prime__~n) (<= is_prime__~m |is_prime__#in~m|)) [2022-11-26 00:06:56,973 INFO L899 garLoopResultBuilder]: For program point L68-1(line 68) no Hoare annotation was computed. [2022-11-26 00:06:56,973 INFO L899 garLoopResultBuilder]: For program point L68-2(lines 68 70) no Hoare annotation was computed. [2022-11-26 00:06:56,976 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:06:56,988 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-26 00:06:57,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:06:57 BoogieIcfgContainer [2022-11-26 00:06:57,004 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-26 00:06:57,004 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-26 00:06:57,005 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-26 00:06:57,005 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-26 00:06:57,005 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:06:45" (3/4) ... [2022-11-26 00:06:57,008 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-26 00:06:57,014 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure multiple_of [2022-11-26 00:06:57,014 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure mult [2022-11-26 00:06:57,015 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_prime_ [2022-11-26 00:06:57,023 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-11-26 00:06:57,023 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-11-26 00:06:57,023 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-26 00:06:57,024 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-26 00:06:57,071 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-26 00:06:57,071 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-26 00:06:57,072 INFO L158 Benchmark]: Toolchain (without parser) took 12288.93ms. Allocated memory was 134.2MB in the beginning and 220.2MB in the end (delta: 86.0MB). Free memory was 70.5MB in the beginning and 95.1MB in the end (delta: -24.6MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. [2022-11-26 00:06:57,072 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 134.2MB. Free memory was 109.5MB in the beginning and 109.4MB in the end (delta: 169.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:06:57,073 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.63ms. Allocated memory was 134.2MB in the beginning and 182.5MB in the end (delta: 48.2MB). Free memory was 70.3MB in the beginning and 150.0MB in the end (delta: -79.7MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2022-11-26 00:06:57,073 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.79ms. Allocated memory is still 182.5MB. Free memory was 150.0MB in the beginning and 147.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:06:57,073 INFO L158 Benchmark]: Boogie Preprocessor took 23.51ms. Allocated memory is still 182.5MB. Free memory was 147.9MB in the beginning and 147.1MB in the end (delta: 864.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:06:57,074 INFO L158 Benchmark]: RCFGBuilder took 506.31ms. Allocated memory is still 182.5MB. Free memory was 147.1MB in the beginning and 132.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-26 00:06:57,074 INFO L158 Benchmark]: TraceAbstraction took 11366.93ms. Allocated memory was 182.5MB in the beginning and 220.2MB in the end (delta: 37.7MB). Free memory was 131.1MB in the beginning and 98.2MB in the end (delta: 32.9MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB. [2022-11-26 00:06:57,074 INFO L158 Benchmark]: Witness Printer took 66.78ms. Allocated memory is still 220.2MB. Free memory was 98.2MB in the beginning and 95.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-26 00:06:57,076 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 134.2MB. Free memory was 109.5MB in the beginning and 109.4MB in the end (delta: 169.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.63ms. Allocated memory was 134.2MB in the beginning and 182.5MB in the end (delta: 48.2MB). Free memory was 70.3MB in the beginning and 150.0MB in the end (delta: -79.7MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.79ms. Allocated memory is still 182.5MB. Free memory was 150.0MB in the beginning and 147.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.51ms. Allocated memory is still 182.5MB. Free memory was 147.9MB in the beginning and 147.1MB in the end (delta: 864.9kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 506.31ms. Allocated memory is still 182.5MB. Free memory was 147.1MB in the beginning and 132.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 11366.93ms. Allocated memory was 182.5MB in the beginning and 220.2MB in the end (delta: 37.7MB). Free memory was 131.1MB in the beginning and 98.2MB in the end (delta: 32.9MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB. * Witness Printer took 66.78ms. Allocated memory is still 220.2MB. Free memory was 98.2MB in the beginning and 95.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 98]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.2s, OverallIterations: 17, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 323 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 291 mSDsluCounter, 3863 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3031 mSDsCounter, 110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1394 IncrementalHoareTripleChecker+Invalid, 1504 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110 mSolverCounterUnsat, 832 mSDtfsCounter, 1394 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 878 GetRequests, 696 SyntacticMatches, 22 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=15, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 34 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 256 PreInvPairs, 304 NumberOfFragments, 153 HoareAnnotationTreeSize, 256 FomulaSimplifications, 227 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 14 FomulaSimplificationsInter, 219 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 1207 NumberOfCodeBlocks, 1198 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1516 ConstructedInterpolants, 0 QuantifiedInterpolants, 3540 SizeOfPredicates, 30 NumberOfNonLiveVariables, 1220 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 30 InterpolantComputations, 11 PerfectInterpolantSequences, 518/702 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: (aux-is_prime_(n, n - 1)-aux == 0 && 1 <= n) || ((n <= 2 && 1 <= n) && n <= n) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-26 00:06:57,113 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cd9405-28a4-4a24-a011-d86eed058751/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE