./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 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Primes.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8 --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 --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 01:00:30,145 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 01:00:30,148 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 01:00:30,221 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 01:00:30,223 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 01:00:30,229 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 01:00:30,231 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 01:00:30,233 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 01:00:30,235 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 01:00:30,236 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 01:00:30,238 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 01:00:30,239 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 01:00:30,240 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 01:00:30,241 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 01:00:30,243 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 01:00:30,245 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 01:00:30,246 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 01:00:30,247 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 01:00:30,250 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 01:00:30,259 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 01:00:30,261 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 01:00:30,264 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 01:00:30,269 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 01:00:30,271 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 01:00:30,275 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 01:00:30,276 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 01:00:30,276 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 01:00:30,277 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 01:00:30,278 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 01:00:30,279 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 01:00:30,280 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 01:00:30,281 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 01:00:30,282 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 01:00:30,283 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 01:00:30,292 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 01:00:30,294 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 01:00:30,295 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 01:00:30,295 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 01:00:30,296 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 01:00:30,297 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 01:00:30,298 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 01:00:30,299 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-07 01:00:30,331 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 01:00:30,332 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 01:00:30,333 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 01:00:30,333 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 01:00:30,333 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 01:00:30,334 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 01:00:30,334 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 01:00:30,334 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 01:00:30,335 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 01:00:30,335 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 01:00:30,335 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 01:00:30,335 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 01:00:30,336 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 01:00:30,336 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 01:00:30,336 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 01:00:30,337 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 01:00:30,337 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 01:00:30,338 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 01:00:30,338 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 01:00:30,338 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 01:00:30,338 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 01:00:30,339 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 01:00:30,339 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 01:00:30,339 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 01:00:30,340 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 01:00:30,340 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 01:00:30,340 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 01:00:30,340 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 01:00:30,341 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 01:00:30,341 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 01:00:30,349 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:00:30,349 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 01:00:30,349 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 01:00:30,350 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 01:00:30,350 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 01:00:30,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 01:00:30,351 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 01:00:30,351 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 01:00:30,351 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 01:00:30,351 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 [2021-11-07 01:00:30,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 01:00:30,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 01:00:30,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 01:00:30,683 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 01:00:30,684 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 01:00:30,685 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/recursive/Primes.c [2021-11-07 01:00:30,761 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/data/34abcbb6b/fe1244665e594c6d8f50f5f34f7cce96/FLAGf17e417f4 [2021-11-07 01:00:31,282 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 01:00:31,283 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/sv-benchmarks/c/recursive/Primes.c [2021-11-07 01:00:31,291 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/data/34abcbb6b/fe1244665e594c6d8f50f5f34f7cce96/FLAGf17e417f4 [2021-11-07 01:00:31,642 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/data/34abcbb6b/fe1244665e594c6d8f50f5f34f7cce96 [2021-11-07 01:00:31,645 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 01:00:31,647 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 01:00:31,649 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 01:00:31,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 01:00:31,658 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 01:00:31,659 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:00:31" (1/1) ... [2021-11-07 01:00:31,661 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@578cc6e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:00:31, skipping insertion in model container [2021-11-07 01:00:31,662 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:00:31" (1/1) ... [2021-11-07 01:00:31,671 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 01:00:31,707 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 01:00:32,022 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/sv-benchmarks/c/recursive/Primes.c[2190,2203] [2021-11-07 01:00:32,035 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:00:32,045 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 01:00:32,071 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/sv-benchmarks/c/recursive/Primes.c[2190,2203] [2021-11-07 01:00:32,071 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:00:32,091 INFO L208 MainTranslator]: Completed translation [2021-11-07 01:00:32,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:00:32 WrapperNode [2021-11-07 01:00:32,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 01:00:32,095 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 01:00:32,096 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 01:00:32,096 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 01:00:32,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:00:32" (1/1) ... [2021-11-07 01:00:32,132 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:00:32" (1/1) ... [2021-11-07 01:00:32,167 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 01:00:32,168 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 01:00:32,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 01:00:32,168 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 01:00:32,176 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:00:32" (1/1) ... [2021-11-07 01:00:32,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:00:32" (1/1) ... [2021-11-07 01:00:32,179 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:00:32" (1/1) ... [2021-11-07 01:00:32,179 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:00:32" (1/1) ... [2021-11-07 01:00:32,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:00:32" (1/1) ... [2021-11-07 01:00:32,188 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:00:32" (1/1) ... [2021-11-07 01:00:32,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:00:32" (1/1) ... [2021-11-07 01:00:32,193 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 01:00:32,194 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 01:00:32,194 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 01:00:32,194 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 01:00:32,195 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:00:32" (1/1) ... [2021-11-07 01:00:32,207 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:00:32,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:00:32,234 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 01:00:32,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 01:00:32,286 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of [2021-11-07 01:00:32,286 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of [2021-11-07 01:00:32,289 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2021-11-07 01:00:32,289 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2021-11-07 01:00:32,289 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ [2021-11-07 01:00:32,290 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ [2021-11-07 01:00:32,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 01:00:32,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 01:00:32,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 01:00:32,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 01:00:32,613 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 01:00:32,613 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-11-07 01:00:32,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:00:32 BoogieIcfgContainer [2021-11-07 01:00:32,616 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 01:00:32,617 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 01:00:32,618 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 01:00:32,621 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 01:00:32,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:00:31" (1/3) ... [2021-11-07 01:00:32,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c10bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:00:32, skipping insertion in model container [2021-11-07 01:00:32,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:00:32" (2/3) ... [2021-11-07 01:00:32,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c10bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:00:32, skipping insertion in model container [2021-11-07 01:00:32,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:00:32" (3/3) ... [2021-11-07 01:00:32,624 INFO L111 eAbstractionObserver]: Analyzing ICFG Primes.c [2021-11-07 01:00:32,629 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 01:00:32,630 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-07 01:00:32,696 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 01:00:32,702 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 01:00:32,703 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-07 01:00:32,720 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) [2021-11-07 01:00:32,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 01:00:32,746 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:32,747 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:32,747 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:00:32,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:32,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1349448312, now seen corresponding path program 1 times [2021-11-07 01:00:32,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:32,764 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325356548] [2021-11-07 01:00:32,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:32,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:32,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:32,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:32,983 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:32,985 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325356548] [2021-11-07 01:00:32,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325356548] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:32,987 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:32,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:00:32,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060320163] [2021-11-07 01:00:32,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:00:32,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:33,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:00:33,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:00:33,031 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) [2021-11-07 01:00:33,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:33,098 INFO L93 Difference]: Finished difference Result 54 states and 76 transitions. [2021-11-07 01:00:33,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:00:33,100 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 [2021-11-07 01:00:33,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:33,110 INFO L225 Difference]: With dead ends: 54 [2021-11-07 01:00:33,111 INFO L226 Difference]: Without dead ends: 47 [2021-11-07 01:00:33,114 INFO L786 BasicCegarLoop]: 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 [2021-11-07 01:00:33,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-11-07 01:00:33,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2021-11-07 01:00:33,154 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) [2021-11-07 01:00:33,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2021-11-07 01:00:33,158 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 13 [2021-11-07 01:00:33,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:33,160 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2021-11-07 01:00:33,161 INFO L471 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) [2021-11-07 01:00:33,161 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2021-11-07 01:00:33,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-07 01:00:33,164 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:33,164 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:33,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 01:00:33,165 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:00:33,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:33,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1094481281, now seen corresponding path program 1 times [2021-11-07 01:00:33,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:33,167 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285069992] [2021-11-07 01:00:33,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:33,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:33,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:33,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:33,277 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:33,277 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285069992] [2021-11-07 01:00:33,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285069992] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:33,278 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:33,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 01:00:33,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508158469] [2021-11-07 01:00:33,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:00:33,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:33,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:00:33,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:00:33,281 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-07 01:00:33,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:33,339 INFO L93 Difference]: Finished difference Result 68 states and 90 transitions. [2021-11-07 01:00:33,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:00:33,340 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2021-11-07 01:00:33,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:33,344 INFO L225 Difference]: With dead ends: 68 [2021-11-07 01:00:33,344 INFO L226 Difference]: Without dead ends: 49 [2021-11-07 01:00:33,345 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:00:33,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-11-07 01:00:33,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2021-11-07 01:00:33,356 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, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2021-11-07 01:00:33,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2021-11-07 01:00:33,359 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 66 transitions. Word has length 20 [2021-11-07 01:00:33,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:33,359 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 66 transitions. [2021-11-07 01:00:33,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-07 01:00:33,360 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 66 transitions. [2021-11-07 01:00:33,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 01:00:33,363 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:33,363 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:33,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 01:00:33,364 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:00:33,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:33,365 INFO L85 PathProgramCache]: Analyzing trace with hash -306925128, now seen corresponding path program 1 times [2021-11-07 01:00:33,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:33,366 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833689077] [2021-11-07 01:00:33,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:33,367 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:33,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:33,543 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:33,543 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833689077] [2021-11-07 01:00:33,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833689077] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:33,544 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:33,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 01:00:33,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391977996] [2021-11-07 01:00:33,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:00:33,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:33,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:00:33,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:00:33,550 INFO L87 Difference]: Start difference. First operand 49 states and 66 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) 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) [2021-11-07 01:00:33,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:33,607 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2021-11-07 01:00:33,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:00:33,608 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) 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 [2021-11-07 01:00:33,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:33,611 INFO L225 Difference]: With dead ends: 55 [2021-11-07 01:00:33,613 INFO L226 Difference]: Without dead ends: 51 [2021-11-07 01:00:33,614 INFO L786 BasicCegarLoop]: 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 [2021-11-07 01:00:33,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-11-07 01:00:33,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-11-07 01:00:33,627 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) [2021-11-07 01:00:33,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2021-11-07 01:00:33,635 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 21 [2021-11-07 01:00:33,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:33,636 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2021-11-07 01:00:33,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) 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) [2021-11-07 01:00:33,637 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2021-11-07 01:00:33,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-07 01:00:33,640 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:33,641 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:33,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 01:00:33,643 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:00:33,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:33,644 INFO L85 PathProgramCache]: Analyzing trace with hash -224959538, now seen corresponding path program 1 times [2021-11-07 01:00:33,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:33,645 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593589794] [2021-11-07 01:00:33,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:33,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:33,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:00:33,743 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:33,743 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593589794] [2021-11-07 01:00:33,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593589794] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:33,744 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:33,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:00:33,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006337082] [2021-11-07 01:00:33,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:00:33,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:33,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:00:33,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:00:33,747 INFO L87 Difference]: Start difference. First operand 51 states and 69 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) [2021-11-07 01:00:33,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:33,821 INFO L93 Difference]: Finished difference Result 57 states and 76 transitions. [2021-11-07 01:00:33,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:00:33,822 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 22 [2021-11-07 01:00:33,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:33,831 INFO L225 Difference]: With dead ends: 57 [2021-11-07 01:00:33,831 INFO L226 Difference]: Without dead ends: 53 [2021-11-07 01:00:33,832 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:00:33,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-11-07 01:00:33,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2021-11-07 01:00:33,841 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) [2021-11-07 01:00:33,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2021-11-07 01:00:33,844 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 22 [2021-11-07 01:00:33,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:33,844 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2021-11-07 01:00:33,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) [2021-11-07 01:00:33,845 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2021-11-07 01:00:33,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-07 01:00:33,847 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:33,847 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:33,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 01:00:33,848 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:00:33,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:33,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1677803704, now seen corresponding path program 1 times [2021-11-07 01:00:33,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:33,850 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270480275] [2021-11-07 01:00:33,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:33,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:33,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:33,987 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 01:00:33,987 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:33,987 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270480275] [2021-11-07 01:00:33,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270480275] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:00:33,988 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838843943] [2021-11-07 01:00:33,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:33,989 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:00:33,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:00:33,997 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:00:34,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-07 01:00:34,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:34,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-07 01:00:34,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:00:34,326 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-07 01:00:34,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:00:34,609 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 01:00:34,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838843943] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:00:34,610 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1259778353] [2021-11-07 01:00:34,666 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2021-11-07 01:00:34,666 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:00:34,672 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 01:00:34,673 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:00:34,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2021-11-07 01:00:34,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506354148] [2021-11-07 01:00:34,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-07 01:00:34,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:34,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-07 01:00:34,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-11-07 01:00:34,676 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) [2021-11-07 01:00:34,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:34,816 INFO L93 Difference]: Finished difference Result 66 states and 88 transitions. [2021-11-07 01:00:34,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 01:00:34,817 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 [2021-11-07 01:00:34,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:34,819 INFO L225 Difference]: With dead ends: 66 [2021-11-07 01:00:34,819 INFO L226 Difference]: Without dead ends: 49 [2021-11-07 01:00:34,820 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2021-11-07 01:00:34,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-11-07 01:00:34,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2021-11-07 01:00:34,828 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) [2021-11-07 01:00:34,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2021-11-07 01:00:34,830 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 29 [2021-11-07 01:00:34,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:34,830 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2021-11-07 01:00:34,831 INFO L471 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) [2021-11-07 01:00:34,831 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2021-11-07 01:00:34,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-07 01:00:34,833 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:34,833 INFO L513 BasicCegarLoop]: 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] [2021-11-07 01:00:34,882 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-07 01:00:35,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:00:35,057 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:00:35,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:35,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1617599152, now seen corresponding path program 1 times [2021-11-07 01:00:35,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:35,058 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599074106] [2021-11-07 01:00:35,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:35,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:35,274 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 01:00:35,274 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:35,275 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599074106] [2021-11-07 01:00:35,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599074106] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:00:35,275 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693487682] [2021-11-07 01:00:35,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:35,276 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:00:35,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:00:35,280 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:00:35,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-07 01:00:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:35,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-07 01:00:35,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:00:35,679 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 01:00:35,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:00:36,134 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 01:00:36,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693487682] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:00:36,135 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [381347062] [2021-11-07 01:00:36,139 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2021-11-07 01:00:36,139 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:00:36,140 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 01:00:36,141 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:00:36,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2021-11-07 01:00:36,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960977117] [2021-11-07 01:00:36,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-07 01:00:36,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:36,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-07 01:00:36,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2021-11-07 01:00:36,145 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand has 24 states, 21 states have (on average 2.238095238095238) internal successors, (47), 18 states have internal predecessors, (47), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2021-11-07 01:00:36,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:36,547 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2021-11-07 01:00:36,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 01:00:36,548 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.238095238095238) internal successors, (47), 18 states have internal predecessors, (47), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 30 [2021-11-07 01:00:36,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:36,555 INFO L225 Difference]: With dead ends: 68 [2021-11-07 01:00:36,555 INFO L226 Difference]: Without dead ends: 52 [2021-11-07 01:00:36,557 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=968, Unknown=0, NotChecked=0, Total=1122 [2021-11-07 01:00:36,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-11-07 01:00:36,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2021-11-07 01:00:36,574 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) [2021-11-07 01:00:36,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2021-11-07 01:00:36,576 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 30 [2021-11-07 01:00:36,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:36,576 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2021-11-07 01:00:36,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 2.238095238095238) internal successors, (47), 18 states have internal predecessors, (47), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2021-11-07 01:00:36,577 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2021-11-07 01:00:36,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-07 01:00:36,579 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:36,579 INFO L513 BasicCegarLoop]: 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] [2021-11-07 01:00:36,608 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-07 01:00:36,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-11-07 01:00:36,802 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:00:36,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:36,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1287840268, now seen corresponding path program 1 times [2021-11-07 01:00:36,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:36,803 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602246765] [2021-11-07 01:00:36,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:36,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:36,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:36,918 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-07 01:00:36,918 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:36,919 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602246765] [2021-11-07 01:00:36,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602246765] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:36,919 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:36,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-07 01:00:36,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217542511] [2021-11-07 01:00:36,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 01:00:36,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:36,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 01:00:36,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:00:36,924 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) [2021-11-07 01:00:36,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:36,986 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2021-11-07 01:00:36,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:00:36,987 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 [2021-11-07 01:00:36,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:36,994 INFO L225 Difference]: With dead ends: 70 [2021-11-07 01:00:36,994 INFO L226 Difference]: Without dead ends: 51 [2021-11-07 01:00:36,996 INFO L786 BasicCegarLoop]: 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 [2021-11-07 01:00:36,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-11-07 01:00:37,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2021-11-07 01:00:37,010 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) [2021-11-07 01:00:37,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2021-11-07 01:00:37,016 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 32 [2021-11-07 01:00:37,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:37,017 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2021-11-07 01:00:37,017 INFO L471 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) [2021-11-07 01:00:37,017 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2021-11-07 01:00:37,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-07 01:00:37,025 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:37,025 INFO L513 BasicCegarLoop]: 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] [2021-11-07 01:00:37,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 01:00:37,026 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:00:37,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:37,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1285376925, now seen corresponding path program 1 times [2021-11-07 01:00:37,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:37,027 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426627298] [2021-11-07 01:00:37,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:37,027 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:37,122 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-07 01:00:37,122 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:37,123 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426627298] [2021-11-07 01:00:37,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426627298] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:37,123 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:37,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:00:37,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641175981] [2021-11-07 01:00:37,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:00:37,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:37,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:00:37,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:00:37,126 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) [2021-11-07 01:00:37,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:37,147 INFO L93 Difference]: Finished difference Result 99 states and 126 transitions. [2021-11-07 01:00:37,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:00:37,160 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 [2021-11-07 01:00:37,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:37,162 INFO L225 Difference]: With dead ends: 99 [2021-11-07 01:00:37,162 INFO L226 Difference]: Without dead ends: 53 [2021-11-07 01:00:37,163 INFO L786 BasicCegarLoop]: 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 [2021-11-07 01:00:37,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-11-07 01:00:37,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-11-07 01:00:37,170 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) [2021-11-07 01:00:37,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2021-11-07 01:00:37,171 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 50 [2021-11-07 01:00:37,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:37,172 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2021-11-07 01:00:37,172 INFO L471 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) [2021-11-07 01:00:37,172 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2021-11-07 01:00:37,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-07 01:00:37,174 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:37,174 INFO L513 BasicCegarLoop]: 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] [2021-11-07 01:00:37,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 01:00:37,175 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:00:37,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:37,175 INFO L85 PathProgramCache]: Analyzing trace with hash -68737779, now seen corresponding path program 1 times [2021-11-07 01:00:37,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:37,176 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979815945] [2021-11-07 01:00:37,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:37,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:37,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:37,296 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-07 01:00:37,296 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:37,297 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979815945] [2021-11-07 01:00:37,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979815945] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:00:37,297 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134346105] [2021-11-07 01:00:37,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:37,297 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:00:37,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:00:37,299 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:00:37,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-07 01:00:37,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:37,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-07 01:00:37,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:00:37,613 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-07 01:00:37,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:00:37,873 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-07 01:00:37,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134346105] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-07 01:00:37,874 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2021-11-07 01:00:37,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 5] total 11 [2021-11-07 01:00:37,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870953498] [2021-11-07 01:00:37,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:00:37,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:37,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:00:37,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-11-07 01:00:37,876 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) [2021-11-07 01:00:37,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:37,947 INFO L93 Difference]: Finished difference Result 106 states and 139 transitions. [2021-11-07 01:00:37,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:00:37,948 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 [2021-11-07 01:00:37,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:37,951 INFO L225 Difference]: With dead ends: 106 [2021-11-07 01:00:37,951 INFO L226 Difference]: Without dead ends: 56 [2021-11-07 01:00:37,957 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-11-07 01:00:37,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-11-07 01:00:37,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2021-11-07 01:00:37,977 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) [2021-11-07 01:00:37,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2021-11-07 01:00:37,982 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 72 transitions. Word has length 51 [2021-11-07 01:00:37,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:37,982 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 72 transitions. [2021-11-07 01:00:37,982 INFO L471 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) [2021-11-07 01:00:37,983 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2021-11-07 01:00:37,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-07 01:00:37,988 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:37,988 INFO L513 BasicCegarLoop]: 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] [2021-11-07 01:00:38,021 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-07 01:00:38,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:00:38,204 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:00:38,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:38,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1129977969, now seen corresponding path program 1 times [2021-11-07 01:00:38,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:38,205 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522555904] [2021-11-07 01:00:38,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:38,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:38,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:38,249 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-07 01:00:38,250 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:38,250 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522555904] [2021-11-07 01:00:38,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522555904] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:38,250 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:38,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:00:38,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25599885] [2021-11-07 01:00:38,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:00:38,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:38,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:00:38,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:00:38,252 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) [2021-11-07 01:00:38,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:38,278 INFO L93 Difference]: Finished difference Result 114 states and 151 transitions. [2021-11-07 01:00:38,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:00:38,279 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 [2021-11-07 01:00:38,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:38,281 INFO L225 Difference]: With dead ends: 114 [2021-11-07 01:00:38,281 INFO L226 Difference]: Without dead ends: 61 [2021-11-07 01:00:38,284 INFO L786 BasicCegarLoop]: 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 [2021-11-07 01:00:38,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-11-07 01:00:38,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2021-11-07 01:00:38,299 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) [2021-11-07 01:00:38,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 73 transitions. [2021-11-07 01:00:38,302 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 73 transitions. Word has length 56 [2021-11-07 01:00:38,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:38,303 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 73 transitions. [2021-11-07 01:00:38,303 INFO L471 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) [2021-11-07 01:00:38,303 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 73 transitions. [2021-11-07 01:00:38,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-07 01:00:38,306 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:38,306 INFO L513 BasicCegarLoop]: 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] [2021-11-07 01:00:38,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-07 01:00:38,306 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:00:38,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:38,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1501667645, now seen corresponding path program 1 times [2021-11-07 01:00:38,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:38,309 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685911373] [2021-11-07 01:00:38,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:38,310 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:38,408 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-11-07 01:00:38,408 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:38,408 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685911373] [2021-11-07 01:00:38,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685911373] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:38,410 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:38,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 01:00:38,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708789272] [2021-11-07 01:00:38,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:00:38,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:38,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:00:38,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:00:38,414 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) [2021-11-07 01:00:38,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:38,442 INFO L93 Difference]: Finished difference Result 117 states and 154 transitions. [2021-11-07 01:00:38,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:00:38,443 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 [2021-11-07 01:00:38,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:38,447 INFO L225 Difference]: With dead ends: 117 [2021-11-07 01:00:38,447 INFO L226 Difference]: Without dead ends: 63 [2021-11-07 01:00:38,448 INFO L786 BasicCegarLoop]: 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 [2021-11-07 01:00:38,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-11-07 01:00:38,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 58. [2021-11-07 01:00:38,464 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) [2021-11-07 01:00:38,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 74 transitions. [2021-11-07 01:00:38,466 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 74 transitions. Word has length 65 [2021-11-07 01:00:38,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:38,467 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 74 transitions. [2021-11-07 01:00:38,467 INFO L471 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) [2021-11-07 01:00:38,467 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 74 transitions. [2021-11-07 01:00:38,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-07 01:00:38,470 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:38,470 INFO L513 BasicCegarLoop]: 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] [2021-11-07 01:00:38,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-07 01:00:38,471 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:00:38,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:38,471 INFO L85 PathProgramCache]: Analyzing trace with hash -2075972807, now seen corresponding path program 1 times [2021-11-07 01:00:38,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:38,472 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384165844] [2021-11-07 01:00:38,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:38,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:38,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:38,645 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-07 01:00:38,645 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:38,645 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384165844] [2021-11-07 01:00:38,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384165844] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:00:38,646 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627010563] [2021-11-07 01:00:38,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:38,646 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:00:38,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:00:38,648 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:00:38,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-07 01:00:38,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:38,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-07 01:00:38,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:00:39,019 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-07 01:00:39,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:00:39,412 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-07 01:00:39,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627010563] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:00:39,413 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1985035178] [2021-11-07 01:00:39,419 INFO L159 IcfgInterpreter]: Started Sifa with 43 locations of interest [2021-11-07 01:00:39,419 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:00:39,420 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 01:00:39,420 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:00:39,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2021-11-07 01:00:39,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561474874] [2021-11-07 01:00:39,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 01:00:39,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:39,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 01:00:39,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-11-07 01:00:39,427 INFO L87 Difference]: Start difference. First operand 58 states and 74 transitions. Second operand has 13 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 13 states have internal predecessors, (85), 11 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (17), 6 states have call predecessors, (17), 11 states have call successors, (17) [2021-11-07 01:00:39,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:39,807 INFO L93 Difference]: Finished difference Result 141 states and 211 transitions. [2021-11-07 01:00:39,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-07 01:00:39,810 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 13 states have internal predecessors, (85), 11 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (17), 6 states have call predecessors, (17), 11 states have call successors, (17) Word has length 66 [2021-11-07 01:00:39,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:39,811 INFO L225 Difference]: With dead ends: 141 [2021-11-07 01:00:39,811 INFO L226 Difference]: Without dead ends: 62 [2021-11-07 01:00:39,812 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2021-11-07 01:00:39,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-11-07 01:00:39,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2021-11-07 01:00:39,818 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) [2021-11-07 01:00:39,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2021-11-07 01:00:39,819 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 66 [2021-11-07 01:00:39,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:39,819 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2021-11-07 01:00:39,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 13 states have internal predecessors, (85), 11 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (17), 6 states have call predecessors, (17), 11 states have call successors, (17) [2021-11-07 01:00:39,819 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2021-11-07 01:00:39,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-07 01:00:39,820 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:39,821 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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] [2021-11-07 01:00:39,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-07 01:00:40,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:00:40,044 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:00:40,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:40,045 INFO L85 PathProgramCache]: Analyzing trace with hash -814182713, now seen corresponding path program 1 times [2021-11-07 01:00:40,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:40,045 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830240740] [2021-11-07 01:00:40,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:40,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:40,112 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-11-07 01:00:40,113 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:40,113 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830240740] [2021-11-07 01:00:40,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830240740] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:40,113 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:40,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 01:00:40,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170124797] [2021-11-07 01:00:40,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:00:40,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:40,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:00:40,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:00:40,116 INFO L87 Difference]: Start difference. First operand 57 states and 70 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) [2021-11-07 01:00:40,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:40,142 INFO L93 Difference]: Finished difference Result 122 states and 154 transitions. [2021-11-07 01:00:40,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:00:40,142 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 75 [2021-11-07 01:00:40,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:40,144 INFO L225 Difference]: With dead ends: 122 [2021-11-07 01:00:40,144 INFO L226 Difference]: Without dead ends: 68 [2021-11-07 01:00:40,145 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:00:40,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-11-07 01:00:40,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2021-11-07 01:00:40,155 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) [2021-11-07 01:00:40,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2021-11-07 01:00:40,157 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 75 [2021-11-07 01:00:40,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:40,158 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2021-11-07 01:00:40,158 INFO L471 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) [2021-11-07 01:00:40,158 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2021-11-07 01:00:40,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-07 01:00:40,160 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:40,160 INFO L513 BasicCegarLoop]: 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] [2021-11-07 01:00:40,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-07 01:00:40,161 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:00:40,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:40,161 INFO L85 PathProgramCache]: Analyzing trace with hash -2129490437, now seen corresponding path program 1 times [2021-11-07 01:00:40,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:40,162 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625818772] [2021-11-07 01:00:40,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:40,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:40,336 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-07 01:00:40,336 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:40,337 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625818772] [2021-11-07 01:00:40,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625818772] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:00:40,337 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519550546] [2021-11-07 01:00:40,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:40,337 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:00:40,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:00:40,338 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:00:40,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-07 01:00:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:40,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-07 01:00:40,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:00:40,990 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-07 01:00:40,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:00:41,926 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-07 01:00:41,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519550546] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:00:41,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [877055542] [2021-11-07 01:00:41,931 INFO L159 IcfgInterpreter]: Started Sifa with 41 locations of interest [2021-11-07 01:00:41,931 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:00:41,932 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 01:00:41,933 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:00:41,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 20 [2021-11-07 01:00:41,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440388388] [2021-11-07 01:00:41,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-07 01:00:41,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:41,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-07 01:00:41,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2021-11-07 01:00:41,936 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) [2021-11-07 01:00:42,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:42,250 INFO L93 Difference]: Finished difference Result 105 states and 134 transitions. [2021-11-07 01:00:42,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-07 01:00:42,251 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 [2021-11-07 01:00:42,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:42,252 INFO L225 Difference]: With dead ends: 105 [2021-11-07 01:00:42,253 INFO L226 Difference]: Without dead ends: 86 [2021-11-07 01:00:42,253 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2021-11-07 01:00:42,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-11-07 01:00:42,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2021-11-07 01:00:42,261 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) [2021-11-07 01:00:42,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 97 transitions. [2021-11-07 01:00:42,263 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 97 transitions. Word has length 69 [2021-11-07 01:00:42,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:42,263 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 97 transitions. [2021-11-07 01:00:42,264 INFO L471 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) [2021-11-07 01:00:42,264 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 97 transitions. [2021-11-07 01:00:42,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-07 01:00:42,265 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:42,266 INFO L513 BasicCegarLoop]: 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] [2021-11-07 01:00:42,317 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-11-07 01:00:42,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-07 01:00:42,479 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:00:42,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:42,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1734203497, now seen corresponding path program 1 times [2021-11-07 01:00:42,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:42,480 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807435636] [2021-11-07 01:00:42,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:42,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:42,531 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-07 01:00:42,532 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:42,532 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807435636] [2021-11-07 01:00:42,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807435636] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:00:42,533 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:00:42,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:00:42,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556210921] [2021-11-07 01:00:42,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:00:42,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:42,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:00:42,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:00:42,535 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) [2021-11-07 01:00:42,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:42,582 INFO L93 Difference]: Finished difference Result 147 states and 212 transitions. [2021-11-07 01:00:42,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:00:42,583 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 [2021-11-07 01:00:42,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:42,584 INFO L225 Difference]: With dead ends: 147 [2021-11-07 01:00:42,584 INFO L226 Difference]: Without dead ends: 75 [2021-11-07 01:00:42,585 INFO L786 BasicCegarLoop]: 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 [2021-11-07 01:00:42,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-11-07 01:00:42,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-11-07 01:00:42,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, (26), 16 states have call predecessors, (26), 8 states have call successors, (26) [2021-11-07 01:00:42,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 94 transitions. [2021-11-07 01:00:42,594 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 94 transitions. Word has length 76 [2021-11-07 01:00:42,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:42,595 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 94 transitions. [2021-11-07 01:00:42,595 INFO L471 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) [2021-11-07 01:00:42,595 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 94 transitions. [2021-11-07 01:00:42,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-07 01:00:42,597 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:00:42,597 INFO L513 BasicCegarLoop]: 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] [2021-11-07 01:00:42,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-07 01:00:42,598 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:00:42,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:00:42,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1605702583, now seen corresponding path program 2 times [2021-11-07 01:00:42,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:00:42,599 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22946926] [2021-11-07 01:00:42,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:00:42,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:00:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:00:42,700 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 36 proven. 19 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-07 01:00:42,701 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:00:42,701 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22946926] [2021-11-07 01:00:42,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22946926] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:00:42,701 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102967068] [2021-11-07 01:00:42,701 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-07 01:00:42,702 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:00:42,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:00:42,703 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:00:42,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-07 01:00:42,968 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-11-07 01:00:42,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 01:00:42,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-07 01:00:42,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:00:43,339 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 41 proven. 13 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-07 01:00:43,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:00:44,451 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 38 proven. 15 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-11-07 01:00:44,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102967068] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:00:44,451 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [496406140] [2021-11-07 01:00:44,460 INFO L159 IcfgInterpreter]: Started Sifa with 43 locations of interest [2021-11-07 01:00:44,460 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:00:44,461 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-07 01:00:44,462 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:00:44,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 21 [2021-11-07 01:00:44,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632520627] [2021-11-07 01:00:44,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-07 01:00:44,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:00:44,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-07 01:00:44,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2021-11-07 01:00:44,465 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) [2021-11-07 01:00:44,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:00:44,727 INFO L93 Difference]: Finished difference Result 118 states and 166 transitions. [2021-11-07 01:00:44,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-07 01:00:44,730 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 [2021-11-07 01:00:44,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:00:44,730 INFO L225 Difference]: With dead ends: 118 [2021-11-07 01:00:44,730 INFO L226 Difference]: Without dead ends: 0 [2021-11-07 01:00:44,731 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=214, Invalid=656, Unknown=0, NotChecked=0, Total=870 [2021-11-07 01:00:44,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-07 01:00:44,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-07 01:00:44,732 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) [2021-11-07 01:00:44,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-07 01:00:44,732 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2021-11-07 01:00:44,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:00:44,732 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-07 01:00:44,732 INFO L471 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) [2021-11-07 01:00:44,732 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-07 01:00:44,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-07 01:00:44,734 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:00:44,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-07 01:00:44,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-07 01:00:44,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-07 01:00:44,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,946 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,956 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,956 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,960 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,962 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,967 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,969 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,971 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,972 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,977 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,981 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,981 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,983 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,985 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,985 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,987 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,987 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,989 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,997 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,997 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:44,999 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,003 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,004 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,005 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,005 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,007 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,007 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,011 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,013 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,014 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,014 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,015 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,020 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,023 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,026 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,027 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,033 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,034 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,037 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,037 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,038 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,040 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,043 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,046 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,048 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,051 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,053 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,053 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,054 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,054 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,059 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,061 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,062 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,063 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,070 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,071 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,074 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,075 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,083 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,083 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,086 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,086 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,090 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,090 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,091 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,092 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,092 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,094 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,095 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,095 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,099 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,099 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,101 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,101 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,102 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,107 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,107 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,109 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,111 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,117 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,120 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,121 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,122 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,123 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,123 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,135 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,141 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,144 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,146 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,151 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,153 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,155 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,156 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,156 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,166 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,167 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,187 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:00:45,326 INFO L853 garLoopResultBuilder]: At program point L33(line 33) the Hoare annotation is: (and (<= |multiple_of_#in~m| multiple_of_~m) (< |multiple_of_#in~m| 0) (= |multiple_of_#in~n| multiple_of_~n) (<= multiple_of_~m |multiple_of_#in~m|)) [2021-11-07 01:00:45,326 INFO L857 garLoopResultBuilder]: For program point L32(lines 32 34) no Hoare annotation was computed. [2021-11-07 01:00:45,326 INFO L857 garLoopResultBuilder]: For program point L33-1(line 33) no Hoare annotation was computed. [2021-11-07 01:00:45,326 INFO L857 garLoopResultBuilder]: For program point multiple_ofFINAL(lines 31 45) no Hoare annotation was computed. [2021-11-07 01:00:45,326 INFO L853 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)) [2021-11-07 01:00:45,326 INFO L857 garLoopResultBuilder]: For program point L44-1(line 44) no Hoare annotation was computed. [2021-11-07 01:00:45,326 INFO L860 garLoopResultBuilder]: At program point multiple_ofENTRY(lines 31 45) the Hoare annotation is: true [2021-11-07 01:00:45,326 INFO L857 garLoopResultBuilder]: For program point L41(lines 41 43) no Hoare annotation was computed. [2021-11-07 01:00:45,327 INFO L857 garLoopResultBuilder]: For program point L38(lines 38 40) no Hoare annotation was computed. [2021-11-07 01:00:45,327 INFO L853 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)) [2021-11-07 01:00:45,327 INFO L857 garLoopResultBuilder]: For program point multiple_ofEXIT(lines 31 45) no Hoare annotation was computed. [2021-11-07 01:00:45,327 INFO L857 garLoopResultBuilder]: For program point L35(lines 35 37) no Hoare annotation was computed. [2021-11-07 01:00:45,327 INFO L857 garLoopResultBuilder]: For program point L36-1(line 36) no Hoare annotation was computed. [2021-11-07 01:00:45,327 INFO L860 garLoopResultBuilder]: At program point multENTRY(lines 17 28) the Hoare annotation is: true [2021-11-07 01:00:45,327 INFO L853 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)) [2021-11-07 01:00:45,327 INFO L857 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2021-11-07 01:00:45,327 INFO L857 garLoopResultBuilder]: For program point L24(lines 24 26) no Hoare annotation was computed. [2021-11-07 01:00:45,328 INFO L857 garLoopResultBuilder]: For program point L21(lines 21 23) no Hoare annotation was computed. [2021-11-07 01:00:45,328 INFO L853 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (and (<= |mult_#in~m| mult_~m) (<= |mult_#in~m| 0)) [2021-11-07 01:00:45,328 INFO L857 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2021-11-07 01:00:45,328 INFO L857 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2021-11-07 01:00:45,328 INFO L857 garLoopResultBuilder]: For program point multFINAL(lines 17 28) no Hoare annotation was computed. [2021-11-07 01:00:45,328 INFO L857 garLoopResultBuilder]: For program point multEXIT(lines 17 28) no Hoare annotation was computed. [2021-11-07 01:00:45,328 INFO L857 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2021-11-07 01:00:45,328 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-07 01:00:45,329 INFO L853 garLoopResultBuilder]: At program point L97-1(line 97) the Hoare annotation is: (and (<= ULTIMATE.start_main_~n~0 2) (= ULTIMATE.start_main_~n~0 ULTIMATE.start_is_prime_~n) (<= 1 ULTIMATE.start_main_~n~0)) [2021-11-07 01:00:45,329 INFO L857 garLoopResultBuilder]: For program point L97-2(line 97) no Hoare annotation was computed. [2021-11-07 01:00:45,329 INFO L857 garLoopResultBuilder]: For program point L97-4(lines 97 101) no Hoare annotation was computed. [2021-11-07 01:00:45,329 INFO L857 garLoopResultBuilder]: For program point L91(lines 91 95) no Hoare annotation was computed. [2021-11-07 01:00:45,329 INFO L857 garLoopResultBuilder]: For program point L85(lines 85 89) no Hoare annotation was computed. [2021-11-07 01:00:45,329 INFO L860 garLoopResultBuilder]: At program point L100(lines 76 102) the Hoare annotation is: true [2021-11-07 01:00:45,329 INFO L857 garLoopResultBuilder]: For program point L98(line 98) no Hoare annotation was computed. [2021-11-07 01:00:45,329 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-07 01:00:45,330 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 98) no Hoare annotation was computed. [2021-11-07 01:00:45,330 INFO L853 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (and (= ULTIMATE.start_main_~n~0 ULTIMATE.start_is_prime_~n) (<= 1 ULTIMATE.start_main_~n~0)) [2021-11-07 01:00:45,330 INFO L853 garLoopResultBuilder]: At program point L53-1(line 53) the Hoare annotation is: (or (= |ULTIMATE.start_is_prime_#t~ret12| 0) (and (<= ULTIMATE.start_main_~n~0 2) (= ULTIMATE.start_main_~n~0 ULTIMATE.start_is_prime_~n) (<= 1 ULTIMATE.start_main_~n~0))) [2021-11-07 01:00:45,330 INFO L857 garLoopResultBuilder]: For program point L78(lines 78 82) no Hoare annotation was computed. [2021-11-07 01:00:45,330 INFO L857 garLoopResultBuilder]: For program point L65(lines 65 72) no Hoare annotation was computed. [2021-11-07 01:00:45,330 INFO L857 garLoopResultBuilder]: For program point is_prime_EXIT(lines 57 74) no Hoare annotation was computed. [2021-11-07 01:00:45,330 INFO L857 garLoopResultBuilder]: For program point L64(lines 64 73) no Hoare annotation was computed. [2021-11-07 01:00:45,330 INFO L857 garLoopResultBuilder]: For program point L61(lines 61 63) no Hoare annotation was computed. [2021-11-07 01:00:45,331 INFO L857 garLoopResultBuilder]: For program point is_prime_FINAL(lines 57 74) no Hoare annotation was computed. [2021-11-07 01:00:45,331 INFO L860 garLoopResultBuilder]: At program point is_prime_ENTRY(lines 57 74) the Hoare annotation is: true [2021-11-07 01:00:45,331 INFO L857 garLoopResultBuilder]: For program point L58(lines 58 60) no Hoare annotation was computed. [2021-11-07 01:00:45,331 INFO L853 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (and (let ((.cse0 (= |is_prime__#in~n| is_prime__~n)) (.cse1 (<= |is_prime__#in~m| is_prime__~m))) (or (and (< 1 is_prime__~m) .cse0 (<= |is_prime__#in~m| (div |is_prime__#in~n| 2)) .cse1) (and .cse0 .cse1 (<= |is_prime__#in~n| |is_prime__#in~m|)))) (< 2 is_prime__~n) (<= is_prime__~m |is_prime__#in~m|)) [2021-11-07 01:00:45,331 INFO L857 garLoopResultBuilder]: For program point L71-1(line 71) no Hoare annotation was computed. [2021-11-07 01:00:45,331 INFO L853 garLoopResultBuilder]: At program point L68(line 68) the Hoare annotation is: (and (< 1 is_prime__~m) (= |is_prime__#in~n| is_prime__~n) (<= |is_prime__#in~m| is_prime__~m) (< 2 is_prime__~n) (<= is_prime__~m |is_prime__#in~m|)) [2021-11-07 01:00:45,331 INFO L857 garLoopResultBuilder]: For program point L68-1(line 68) no Hoare annotation was computed. [2021-11-07 01:00:45,331 INFO L857 garLoopResultBuilder]: For program point L68-2(lines 68 70) no Hoare annotation was computed. [2021-11-07 01:00:45,336 INFO L731 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:00:45,338 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 01:00:45,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:00:45 BoogieIcfgContainer [2021-11-07 01:00:45,354 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 01:00:45,355 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 01:00:45,355 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 01:00:45,356 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 01:00:45,356 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:00:32" (3/4) ... [2021-11-07 01:00:45,359 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-07 01:00:45,366 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure multiple_of [2021-11-07 01:00:45,366 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure mult [2021-11-07 01:00:45,366 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_prime_ [2021-11-07 01:00:45,376 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2021-11-07 01:00:45,377 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-11-07 01:00:45,377 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-07 01:00:45,377 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-07 01:00:45,425 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/witness.graphml [2021-11-07 01:00:45,426 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 01:00:45,427 INFO L168 Benchmark]: Toolchain (without parser) took 13779.12 ms. Allocated memory was 83.9 MB in the beginning and 125.8 MB in the end (delta: 41.9 MB). Free memory was 62.0 MB in the beginning and 88.5 MB in the end (delta: -26.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 16.1 GB. [2021-11-07 01:00:45,428 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 83.9 MB. Free memory was 59.2 MB in the beginning and 59.2 MB in the end (delta: 38.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:00:45,428 INFO L168 Benchmark]: CACSL2BoogieTranslator took 445.01 ms. Allocated memory is still 83.9 MB. Free memory was 61.7 MB in the beginning and 59.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-07 01:00:45,429 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.16 ms. Allocated memory is still 83.9 MB. Free memory was 59.9 MB in the beginning and 58.4 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:00:45,429 INFO L168 Benchmark]: Boogie Preprocessor took 24.77 ms. Allocated memory is still 83.9 MB. Free memory was 58.4 MB in the beginning and 57.3 MB in the end (delta: 1.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-07 01:00:45,430 INFO L168 Benchmark]: RCFGBuilder took 422.19 ms. Allocated memory is still 83.9 MB. Free memory was 57.2 MB in the beginning and 44.0 MB in the end (delta: 13.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-11-07 01:00:45,430 INFO L168 Benchmark]: TraceAbstraction took 12736.92 ms. Allocated memory was 83.9 MB in the beginning and 125.8 MB in the end (delta: 41.9 MB). Free memory was 43.5 MB in the beginning and 92.7 MB in the end (delta: -49.2 MB). Peak memory consumption was 57.2 MB. Max. memory is 16.1 GB. [2021-11-07 01:00:45,431 INFO L168 Benchmark]: Witness Printer took 70.96 ms. Allocated memory is still 125.8 MB. Free memory was 92.7 MB in the beginning and 88.5 MB in the end (delta: 4.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 01:00:45,433 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.27 ms. Allocated memory is still 83.9 MB. Free memory was 59.2 MB in the beginning and 59.2 MB in the end (delta: 38.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 445.01 ms. Allocated memory is still 83.9 MB. Free memory was 61.7 MB in the beginning and 59.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 72.16 ms. Allocated memory is still 83.9 MB. Free memory was 59.9 MB in the beginning and 58.4 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 24.77 ms. Allocated memory is still 83.9 MB. Free memory was 58.4 MB in the beginning and 57.3 MB in the end (delta: 1.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 422.19 ms. Allocated memory is still 83.9 MB. Free memory was 57.2 MB in the beginning and 44.0 MB in the end (delta: 13.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 12736.92 ms. Allocated memory was 83.9 MB in the beginning and 125.8 MB in the end (delta: 41.9 MB). Free memory was 43.5 MB in the beginning and 92.7 MB in the end (delta: -49.2 MB). Peak memory consumption was 57.2 MB. Max. memory is 16.1 GB. * Witness Printer took 70.96 ms. Allocated memory is still 125.8 MB. Free memory was 92.7 MB in the beginning and 88.5 MB in the end (delta: 4.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * 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: 12.6s, OverallIterations: 16, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 823 SDtfs, 329 SDslu, 3278 SDs, 0 SdLazy, 1221 SolverSat, 136 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 824 GetRequests, 651 SyntacticMatches, 5 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=14, 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, 16 MinimizatonAttempts, 37 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 250 PreInvPairs, 291 NumberOfFragments, 136 HoareAnnotationTreeSize, 250 FomulaSimplifications, 308 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 14 FomulaSimplificationsInter, 63 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 1090 NumberOfCodeBlocks, 1081 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1392 ConstructedInterpolants, 0 QuantifiedInterpolants, 3126 SizeOfPredicates, 26 NumberOfNonLiveVariables, 1071 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 28 InterpolantComputations, 11 PerfectInterpolantSequences, 506/670 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 || ((n <= 2 && n == n) && 1 <= n) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-11-07 01:00:45,487 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72a33519-7d63-4f66-a2b6-481c54f9bc70/bin/utaipan-UUZaoUuFF8/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